| Publication | Date of Publication | Type |
|---|
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
Journal of Graph Theory | 2023-09-29 | Paper |
| List homomorphisms to separable signed graphs | 2023-06-10 | Paper |
List homomorphisms to separable signed graphs
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
On Finding Hamiltonian Cycles in Barnette Graphs
Fundamenta Informaticae | 2023-03-09 | Paper |
List homomorphism problems for signed trees
Discrete Mathematics | 2023-01-17 | Paper |
On finding hamiltonian cycles in Barnette graphs
(available as arXiv preprint) | 2022-12-05 | Paper |
scientific article; zbMATH DE number 7559391 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Distance-two colourings of Barnette graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Complexity of correspondence \(H\)-colourings
Discrete Applied Mathematics | 2020-05-29 | Paper |
List homomorphism problems for signed trees
(available as arXiv preprint) | 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
European Journal of Combinatorics | 2016-11-07 | Paper |
Complexity of graph partition problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Online channel allocation in FDMA networks with reuse constraints
Information Processing Letters | 2016-06-09 | Paper |
Querying priced information in databases
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The benefits of relaxing punctuality
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Monotone monadic SNP and constraint satisfaction
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Achieving anonymity via clustering
ACM Transactions on Algorithms | 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. II: The irreflexive case
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Finding long paths and cycles in sparse Hamiltonian graphs
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Computing the median with uncertainty
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On hypercube labellings and antipodal monochromatic paths
Discrete Applied Mathematics | 2014-04-16 | Paper |
Edge-coloring almost bipartite multigraphs
Information Processing Letters | 2014-04-11 | Paper |
Graphs admitting \(k\)-NU operations. I: The reflexive case
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Matrix partitions of split graphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
Obstructions to partitions of chordal graphs
Discrete Mathematics | 2013-12-06 | Paper |
| Partitioning chordal graphs | 2013-11-01 | Paper |
Adjusted interval digraphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Maximum gap labelings of graphs
Information Processing Letters | 2013-04-04 | Paper |
On the complexity of MMSNP
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics | 2012-05-11 | Paper |
Dichotomy for tree-structured trigraph list homomorphism problems
Discrete Applied Mathematics | 2011-08-10 | Paper |
Retractions to Pseudoforests
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
On the graph turnpike problem
Information Processing Letters | 2010-08-20 | Paper |
Approximating the Minimum Chain Completion problem
Information Processing Letters | 2010-08-20 | Paper |
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
Information Processing Letters | 2010-06-16 | Paper |
Finding large cycles in Hamiltonian graphs
Discrete Applied Mathematics | 2010-05-25 | Paper |
Near-Unanimity Functions and Varieties of Reflexive Graphs
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Extension problems with degree bounds
Discrete Applied Mathematics | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Matrix partitions with finitely many obstructions
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Matrix partitions with finitely many obstructions
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A combinatorial algorithm for MAX CSP
Information Processing Letters | 2009-03-23 | Paper |
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
On realizations of point determining graphs, and obstructions to full homomorphisms
Discrete Mathematics | 2008-03-13 | Paper |
Matrix Partitions with Finitely Many Obstructions
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Computing shortest paths with uncertainty
Journal of Algorithms | 2007-05-14 | Paper |
| Generalized colouring (matrix partitions) of cographs | 2007-03-05 | Paper |
List homomorphisms of graphs with bounded degrees
Discrete Mathematics | 2007-02-13 | Paper |
The structure of bi-arc trees
Discrete Mathematics | 2007-02-13 | Paper |
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics | 2007-01-09 | Paper |
Matrix partitions of perfect graphs
Discrete Mathematics | 2006-10-30 | Paper |
Full Constraint Satisfaction Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
Disks on a Tree: Analysis of a Combinatorial Game
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
List matrix partitions of chordal graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119649 (Why is no real title available?) | 2004-11-29 | Paper |
Combining request scheduling with web caching
Theoretical Computer Science | 2004-11-23 | Paper |
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science | 2004-10-27 | Paper |
List Partitions
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Acyclic Homomorphisms and Circular Colorings of Digraphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1962828 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962827 (Why is no real title available?) | 2003-08-11 | Paper |
Computing the Median with Uncertainty
SIAM Journal on Computing | 2003-06-19 | Paper |
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms | 2003-05-14 | Paper |
Strong near subgroups and left gyrogroups
Journal of Algebra | 2003-04-02 | Paper |
Bi‐arc graphs and the complexity of list homomorphisms
Journal of Graph Theory | 2003-03-19 | Paper |
Approximating the Longest Cycle Problem in Sparse Graphs
SIAM Journal on Computing | 2002-09-29 | Paper |
Classification of homomorphisms to oriented cycles and of \(k\)-partite satisfiability
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Fanout limitations on constraint systems
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1559578 (Why is no real title available?) | 2001-02-28 | Paper |
A sublinear parallel algorithm for stable matching
Theoretical Computer Science | 2000-08-23 | Paper |
List homomorphisms and circular arc graphs
Combinatorica | 2000-05-14 | Paper |
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
SIAM Journal on Computing | 1998-09-21 | Paper |
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory. Series B | 1998-08-10 | Paper |
The benefits of relaxing punctuality
Journal of the ACM | 1998-01-19 | Paper |
The benefits of relaxing punctuality
Journal of the ACM | 1998-01-19 | Paper |
Stable networks and product graphs
Memoirs of the American Mathematical Society | 1997-11-09 | Paper |
| scientific article; zbMATH DE number 1003296 (Why is no real title available?) | 1997-04-23 | Paper |
Amortized Communication Complexity
SIAM Journal on Computing | 1996-01-28 | Paper |
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences | 1995-10-25 | Paper |
Network flow and 2-satisfiability
Algorithmica | 1994-09-11 | Paper |
Product graph representations
Journal of Graph Theory | 1993-01-17 | Paper |
A new fixed point approach for stable networks and stable marriages
Journal of Computer and System Sciences | 1993-01-17 | Paper |
Determinism vs. Nondeterminism in Multiparty Communication Complexity
SIAM Journal on Computing | 1992-12-06 | Paper |
Toetjes
The American Mathematical Monthly | 1992-06-27 | Paper |
Reliable computation by networks in the presence of noise
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
