| Publication | Date of Publication | Type |
|---|
| On star-multi-interval pairwise compatibility graphs | 2023-11-24 | Paper |
| On the domination number of $t$-constrained de Bruijn graphs | 2023-05-31 | Paper |
| On reconfigurability of VLSI linear arrays | 2023-01-18 | Paper |
| A linear time algorithm for the feasibility of pebble motion on trees | 2022-12-09 | Paper |
| State complexity of SBTA languages | 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 | 2020-10-12 | Paper |
| Some classes of graphs that are not PCGs | 2019-09-10 | Paper |
| Co-divergence and tree topology | 2019-08-01 | Paper |
| A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs | 2019-03-13 | Paper |
| On variants of vertex geography on undirected graphs | 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 | 2018-08-16 | Paper |
| On dynamic threshold graphs and related classes | 2018-03-16 | Paper |
| Systolic tree ω-languages | 2017-12-04 | Paper |
| Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs | 2016-05-03 | Paper |
| Distributed multi-broadcast in unknown radio networks | 2016-03-04 | Paper |
| Fast flooding over Manhattan | 2015-03-02 | Paper |
| Flooding time in edge-Markovian dynamic graphs | 2014-12-12 | Paper |
| Communication in dynamic radio networks | 2014-03-13 | Paper |
| Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game | 2014-01-13 | Paper |
| Reverse-free codes and permutations | 2013-11-01 | Paper |
| Fast flooding over Manhattan | 2013-06-25 | Paper |
| Optimal gossiping in geometric radio networks in the presence of dynamical faults | 2012-06-29 | Paper |
| Rainbow graph splitting | 2011-10-10 | Paper |
| Flooding Time of Edge-Markovian Evolving Graphs | 2011-07-18 | Paper |
| On Reverse-Free Codes and Permutations | 2011-06-17 | Paper |
| Broadcasting in dynamic radio networks | 2009-04-30 | Paper |
| Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks | 2009-03-12 | Paper |
| Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults | 2008-09-17 | Paper |
| An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem | 2008-07-01 | Paper |
| Minimum-energy broadcast and disk cover in grid wireless networks | 2008-06-24 | Paper |
| Spanning Trees with Many Leaves in Regular Bipartite Graphs | 2008-05-27 | Paper |
| On the bounded-hop MST problem on random Euclidean instances | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Delta-systems and qualitative (in)dependence | 2007-05-29 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Round robin is optimal for fault-tolerant broadcasting on wireless networks | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427854 | 2003-09-14 | Paper |
| Distributed broadcast in radio networks of unknown topology. | 2003-08-17 | Paper |
| Delta-systems and qualitative (in)dependence | 2003-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796195 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785466 | 2003-02-04 | Paper |
| Self-similarity bounds for locally thin set families | 2002-06-03 | Paper |
| A better bound for locally thin set families | 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 \(\omega\)-languages | 2002-02-13 | Paper |
| String quartets in binary | 2002-01-21 | Paper |
| Compact representations of the intersection structure of families of finite sets | 2001-03-19 | Paper |
| Systolic tree \(\omega\)-languages: The operational and the logical view | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266540 | 1999-10-03 | Paper |
| A linear-time algorithm for the feasibility of pebble motion on trees | 1999-03-30 | Paper |
| Testing and reconfiguration of VLSI linear arrays | 1998-08-13 | Paper |
| Succinctness of descriptions of SBTA-languages | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381397 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341029 | 1997-06-16 | Paper |
| Completeness results concerning systolic tree automata and E0L languages | 1997-02-28 | Paper |
| On the computational complexity of graph closures | 1997-02-27 | Paper |
| A Kleene-like characterization of languages accepted by systolic tree automata | 1995-09-10 | Paper |
| Languages accepted by systolic \(Y\)-tree automata: Structural characterizations | 1994-07-04 | Paper |
| SYSTOLIC TREE WITH BASE AUTOMATA | 1992-09-27 | Paper |
| On Generalizations of Pairwise Compatibility Graphs | N/A | Paper |
