| Publication | Date of Publication | Type |
|---|
All graphs with at most 8 nodes are 2-interval-PCGs
Fundamenta Informaticae | 2025-10-01 | Paper |
On generalizations of pairwise compatibility graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
On star-k-PCGs: exploring class boundaries for small k values
Acta Informatica | 2025-04-04 | Paper |
On star-multi-interval pairwise compatibility graphs
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
On the domination number of $t$-constrained de Bruijn graphs
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
On reconfigurability of VLSI linear arrays
Lecture Notes in Computer Science | 2023-01-18 | Paper |
A linear time algorithm for the feasibility of pebble motion on trees
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
State complexity of SBTA languages
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
| All Graphs with at most 8 nodes are 2-interval-PCGs | 2022-02-28 | Paper |
String factorisations with maximum or minimum dimension
Theoretical Computer Science | 2020-10-12 | Paper |
Some classes of graphs that are not PCGs
Theoretical Computer Science | 2019-09-10 | Paper |
Co-divergence and tree topology
Journal of Mathematical Biology | 2019-08-01 | Paper |
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
Theoretical Computer Science | 2019-03-13 | Paper |
On variants of vertex geography on undirected graphs
Discrete Applied Mathematics | 2018-12-03 | Paper |
| Graphs that are not pairwise compatible: a new proof technique (extended abstract) | 2018-09-06 | Paper |
Families of locally separated Hamilton paths
Journal of Graph Theory | 2018-08-16 | Paper |
On dynamic threshold graphs and related classes
Theoretical Computer Science | 2018-03-16 | Paper |
Systolic tree ω-languages
STACS 95 | 2017-12-04 | Paper |
Fully dynamically maintaining minimal integral separator for threshold and difference graphs
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Fast flooding over Manhattan
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
Theoretical Computer Science | 2014-01-13 | Paper |
| Reverse-free codes and permutations | 2013-11-01 | Paper |
Fast flooding over Manhattan
Distributed Computing | 2013-06-25 | Paper |
Optimal gossiping in geometric radio networks in the presence of dynamical faults
Networks | 2012-06-29 | Paper |
Rainbow graph splitting
Theoretical Computer Science | 2011-10-10 | Paper |
Flooding time of edge-Markovian evolving graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
On reverse-free codes and permutations
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences | 2009-04-30 | Paper |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Minimum-energy broadcast and disk cover in grid wireless networks
Theoretical Computer Science | 2008-06-24 | Paper |
Spanning Trees with Many Leaves in Regular Bipartite Graphs
Algorithms and Computation | 2008-05-27 | Paper |
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Delta-systems and qualitative (in)dependence
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Round robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 1979510 (Why is no real title available?) | 2003-09-14 | Paper |
Distributed broadcast in radio networks of unknown topology.
Theoretical Computer Science | 2003-08-17 | Paper |
Delta-systems and qualitative (in)dependence
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
| scientific article; zbMATH DE number 1875436 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1848288 (Why is no real title available?) | 2003-02-04 | Paper |
Self-similarity bounds for locally thin set families
Combinatorics, Probability and Computing | 2002-06-03 | Paper |
A better bound for locally thin set families
Journal of Combinatorial Theory. Series A | 2002-03-29 | Paper |
| Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract) | 2002-03-24 | Paper |
Logical definability of Y-tree and trellis systolic -languages
Acta Cybernetica | 2002-02-13 | Paper |
String quartets in binary
Combinatorics, Probability and Computing | 2002-01-21 | Paper |
Compact representations of the intersection structure of families of finite sets
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Systolic tree \(\omega\)-languages: The operational and the logical view
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1346516 (Why is no real title available?) | 1999-10-03 | Paper |
A linear-time algorithm for the feasibility of pebble motion on trees
Algorithmica | 1999-03-30 | Paper |
Testing and reconfiguration of VLSI linear arrays
Theoretical Computer Science | 1998-08-13 | Paper |
Succinctness of descriptions of SBTA-languages
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1136086 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1023021 (Why is no real title available?) | 1997-06-16 | Paper |
Completeness results concerning systolic tree automata and E0L languages
Information Processing Letters | 1997-02-28 | Paper |
On the computational complexity of graph closures
Information Processing Letters | 1997-02-27 | Paper |
A Kleene-like characterization of languages accepted by systolic tree automata
Journal of Computer and System Sciences | 1995-09-10 | Paper |
Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
Acta Informatica | 1994-07-04 | Paper |
SYSTOLIC TREE WITH BASE AUTOMATA
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
On Generalizations of Pairwise Compatibility Graphs
(available as arXiv preprint) | N/A | Paper |
