Results 1  10
of
202
Fish consumption, fish oil, omega3 fatty acids and cardiovascular disease
 J. of the American Heart Association
"... The online version of this article, along with updated information and services, is located on the World Wide Web at: ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
The online version of this article, along with updated information and services, is located on the World Wide Web at:
Introduction to Embedded Systems  A CyberPhysical Systems Approach. http://leeseshia.org
, 2011
"... ..."
Reachability problems for sequential dynamical systems with threshold functions
, 2002
"... A sequential dynamical system (SDS) over a domain § is a triple ¨�©��������� � , where (i) ©�¨������� � is an undirected graph with � nodes with each node having a state value from §, (ii) ������ � ¤ �� � ¦ �������������� � is a set of local transition functions with �� � denoting the local transi ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
A sequential dynamical system (SDS) over a domain § is a triple ¨�©��������� � , where (i) ©�¨������� � is an undirected graph with � nodes with each node having a state value from §, (ii) ������ � ¤ �� � ¦ �������������� � is a set of local transition functions with �� � denoting the local transition function associated with node � � and (iii) � is a permutation of (i.e., a total order on) the nodes in �. A single SDS transition is obtained by updating the states of the nodes in � by evaluating the function associated with each of them in the order given by �. We consider reachability problems for SDSs with restricted local transition functions. Our main intractability results show that the reachability problems for SDSs are PSPACEcomplete when either of the following restrictions hold: (i) � consists of both simplethresholdfunctions and simpleinvertedthreshold functions, or (ii) � consists only of thresholdfunctions that use weights in an asymmetric manner. Moreover, the results hold even for SDSs whose underlying graphs have bounded node degree and bounded pathwidth. Our lower bound results also extend to reachability problems for Hopfield networks and communicating finite state machines. On the positive side, we show that when � consists only of threshold functions that use weights in a symmetric manner, reachability problems can be solved efficiently provided all the weights are strictly positive and the ratio of the largest to the smallest weight is bounded by a polynomial function of the number of nodes.
Axioms for infinite matroids
"... We give axiomatic foundations for nonfinitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966. ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We give axiomatic foundations for nonfinitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.
Recent research
, 2010
"... I am currently working on an induced subgraph characterization of doublesplit graphs. (Recall that doublesplit graphs are one of the ”basic classes ” in the proof of the strong perfect graph theorem.) ..."
Abstract
 Add to MetaCart
I am currently working on an induced subgraph characterization of doublesplit graphs. (Recall that doublesplit graphs are one of the ”basic classes ” in the proof of the strong perfect graph theorem.)
Some recent progress and applications in graph minor theory
, 2006
"... In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the “rough ” structure of graphs excluding a fixed minor. This result was used to prove Wagner’s Conjecture that finite graphs are wellquasiordered under the graph minor relation. Recently, a n ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the “rough ” structure of graphs excluding a fixed minor. This result was used to prove Wagner’s Conjecture that finite graphs are wellquasiordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed.
1 Executive Summary
"... We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the s ..."
Abstract
 Add to MetaCart
We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems.
Generation of simple quadrangulations of the sphere
"... A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3connected, and 3connected without nonfacial 4cycles. In each ca ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3connected, and 3connected without nonfacial 4cycles. In each case we show how the class can be generated by starting with some basic graphs in the class and applying a sequence of local modifications. The duals of our algorithms generate classes of quartic (4regular) planar graphs. In the case of minimum degree 3, our result is a strengthening of a theorem of Nakamoto and almost implicit in Nakamoto’s proof. In the case of 3connectivity, a corollary of our theorem matches a theorem of Batagelj. However, Batagelj’s proof contained a serious error which cannot easily be corrected. We also
Results 1  10
of
202