A classification of tightly attached half-arc-transitive graphs of valency 4 Fulltext Access 33 Pages 2008
Timed Petri nets and timed automata: On the discriminating power of zeno sequences Fulltext Access 35 Pages 2008
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots Fulltext Access 36 Pages 2008
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic Fulltext Access 38 Pages 2008
A framework for the verification of infinite-state graph transformation systems Fulltext Access 39 Pages 2008
Learning indexed families of recursive languages from positive data: A survey Fulltext Access 39 Pages 2008
True-concurrency probabilistic models: Markov nets and a law of large numbers Fulltext Access 42 Pages 2008
Corrigendum to “On zero-divisor graphs of small finite commutative rings”: [Discrete Math. 307 (2007) 1155–1166] Fulltext Access 4 Pages 2007
Semantic and logical foundations of global computing: Papers from the EU-FET global computing initiative (2001-2005) Fulltext Access 4 Pages 2007
Each maximal planar graph with exactly two separating triangles is Hamiltonian Fulltext Access 4 Pages 2007
Every toroidal graph without adjacent triangles is (4,1)*(4,1)*-choosable Fulltext Access 5 Pages 2007
A correct proof of the McMorris–Powers’ theorem on the consensus of phylogenies Fulltext Access 5 Pages 2007