| Publication | Date of Publication | Type |
|---|
| Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture | 2023-09-29 | Paper |
| List homomorphisms to separable signed graphs | 2023-06-10 | Paper |
| List homomorphisms to separable signed graphs | 2023-05-08 | Paper |
| On Finding Hamiltonian Cycles in Barnette Graphs | 2023-03-09 | Paper |
| List homomorphism problems for signed trees | 2023-01-17 | Paper |
| On finding hamiltonian cycles in Barnette graphs | 2022-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089181 | 2022-07-18 | Paper |
| Distance-two colourings of Barnette graphs | 2021-02-08 | Paper |
| Complexity of correspondence \(H\)-colourings | 2020-05-29 | Paper |
| List homomorphism problems for signed trees | 2020-05-12 | Paper |
| Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints | 2019-06-28 | Paper |
| On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs | 2018-06-15 | Paper |
| Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture | 2018-06-14 | Paper |
| Correspondence homomorphisms to reflexive graphs | 2018-04-09 | Paper |
| Colourings, homomorphisms, and partitions of transitive digraphs | 2016-11-07 | Paper |
| Complexity of graph partition problems | 2016-09-29 | Paper |
| Online channel allocation in FDMA networks with reuse constraints | 2016-06-09 | Paper |
| Querying priced information in databases | 2015-09-02 | Paper |
| The benefits of relaxing punctuality | 2015-06-19 | Paper |
| Monotone monadic SNP and constraint satisfaction | 2015-05-07 | Paper |
| Achieving anonymity via clustering | 2014-11-18 | Paper |
| Finding large cycles in Hamiltonian graphs | 2014-10-13 | Paper |
| Two algorithms for general list matrix partitions | 2014-10-13 | Paper |
| Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case | 2014-09-26 | Paper |
| Finding long paths and cycles in sparse Hamiltonian graphs | 2014-09-26 | Paper |
| Computing the median with uncertainty | 2014-09-26 | Paper |
| On hypercube labellings and antipodal monochromatic paths | 2014-04-16 | Paper |
| Edge-coloring almost bipartite multigraphs | 2014-04-11 | Paper |
| Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case | 2014-04-10 | Paper |
| Matrix partitions of split graphs | 2014-02-18 | Paper |
| Obstructions to partitions of chordal graphs | 2013-12-06 | Paper |
| Partitioning chordal graphs | 2013-11-01 | Paper |
| Adjusted interval digraphs | 2013-07-04 | Paper |
| Maximum gap labelings of graphs | 2013-04-04 | Paper |
| On the complexity of MMSNP | 2012-08-22 | Paper |
| Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms | 2012-05-11 | Paper |
| Dichotomy for tree-structured trigraph list homomorphism problems | 2011-08-10 | Paper |
| Retractions to Pseudoforests | 2011-03-15 | Paper |
| On the graph turnpike problem | 2010-08-20 | Paper |
| Approximating the Minimum Chain Completion problem | 2010-08-20 | Paper |
| Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations | 2010-06-16 | Paper |
| Finding large cycles in Hamiltonian graphs | 2010-05-25 | Paper |
| Near-Unanimity Functions and Varieties of Reflexive Graphs | 2009-08-20 | Paper |
| Extension problems with degree bounds | 2009-06-30 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Matrix partitions with finitely many obstructions | 2009-04-07 | Paper |
| A combinatorial algorithm for MAX CSP | 2009-03-23 | Paper |
| Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms | 2009-03-16 | Paper |
| On realizations of point determining graphs, and obstructions to full homomorphisms | 2008-03-13 | Paper |
| Matrix Partitions with Finitely Many Obstructions | 2007-05-29 | Paper |
| A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings | 2007-05-22 | Paper |
| Computing shortest paths with uncertainty | 2007-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424776 | 2007-03-05 | Paper |
| List homomorphisms of graphs with bounded degrees | 2007-02-13 | Paper |
| The structure of bi-arc trees | 2007-02-13 | Paper |
| Digraph matrix partitions and trigraph homomorphisms | 2007-01-09 | Paper |
| Matrix partitions of perfect graphs | 2006-10-30 | Paper |
| Full Constraint Satisfaction Problems | 2006-06-01 | Paper |
| Disks on a Tree: Analysis of a Combinatorial Game | 2006-06-01 | Paper |
| List matrix partitions of chordal graphs | 2006-03-20 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Incremental Clustering and Dynamic Information Retrieval | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828920 | 2004-11-29 | Paper |
| Combining request scheduling with web caching | 2004-11-23 | Paper |
| Dichotomies for classes of homomorphism problems involving unary functions | 2004-10-27 | Paper |
| List Partitions | 2004-01-08 | Paper |
| Acyclic Homomorphisms and Circular Colorings of Digraphs | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418665 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418664 | 2003-08-11 | Paper |
| Computing the Median with Uncertainty | 2003-06-19 | Paper |
| Worst-case time bounds for coloring and satisfiability problems | 2003-05-14 | Paper |
| Strong near subgroups and left gyrogroups | 2003-04-02 | Paper |
| Bi‐arc graphs and the complexity of list homomorphisms | 2003-03-19 | Paper |
| Approximating the Longest Cycle Problem in Sparse Graphs | 2002-09-29 | Paper |
| Classification of homomorphisms to oriented cycles and of \(k\)-partite satisfiability | 2001-11-11 | Paper |
| Fanout limitations on constraint systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527030 | 2001-02-28 | Paper |
| A sublinear parallel algorithm for stable matching | 2000-08-23 | Paper |
| List homomorphisms and circular arc graphs | 2000-05-14 | Paper |
| The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory | 1998-09-21 | Paper |
| List homomorphisms to reflexive graphs | 1998-08-10 | Paper |
| The benefits of relaxing punctuality | 1998-01-19 | Paper |
| Stable networks and product graphs | 1997-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128926 | 1997-04-23 | Paper |
| Amortized Communication Complexity | 1996-01-28 | Paper |
| Clique partitions, graph compression and speeding-up algorithms | 1995-10-25 | Paper |
| Network flow and 2-satisfiability | 1994-09-11 | Paper |
| Product graph representations | 1993-01-17 | Paper |
| A new fixed point approach for stable networks and stable marriages | 1993-01-17 | Paper |
| Determinism vs. Nondeterminism in Multiparty Communication Complexity | 1992-12-06 | Paper |
| Toetjes | 1992-06-27 | Paper |
| Reliable computation by networks in the presence of noise | 1989-01-01 | Paper |
