| Publication | Date of Publication | Type |
|---|
Min orderings and list homomorphism dichotomies for graphs and signed graphs
Algorithmica | 2024-08-02 | Paper |
| Bi-arc digraphs: recognition algorithm and applications | 2024-05-31 | Paper |
| Vertex ordering with precedence constraints | 2024-05-29 | Paper |
Recognizing interval bigraphs by forbidden patterns
Journal of Graph Theory | 2023-10-05 | Paper |
Min orderings and list homomorphism dichotomies for signed and unsigned graphs
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
scientific article; zbMATH DE number 7561584 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Interval-like graphs and digraphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Min-orderable digraphs
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Space complexity of list <i>H</i>-colouring: a dichotomy
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Pattern overlap implies runaway growth in hierarchical tile systems | 2017-10-10 | Paper |
| The dichotomy of list homomorphisms for digraphs | 2017-09-29 | Paper |
Pattern overlap implies runaway growth in hierarchical tile systems
(available as arXiv preprint) | 2017-03-30 | Paper |
| PTAS for ordered instances of resource allocation problems | 2017-02-21 | Paper |
Interval minors of complete bipartite graphs
Journal of Graph Theory | 2016-08-12 | Paper |
| Bi-Arc Digraphs and Conservative Polymorphisms | 2016-08-11 | Paper |
Approximation algorithms for generalized MST and TSP in grid clusters
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Ordering without forbidden patterns
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Graph classes and Ramsey numbers
Discrete Applied Mathematics | 2014-08-22 | Paper |
Finding clubs in graph classes
Discrete Applied Mathematics | 2014-08-22 | Paper |
Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value''
Theory of Computing Systems | 2013-12-02 | Paper |
Adjusted interval digraphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Cliques and clubs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
The dichotomy of minimum cost homomorphism problems for digraphs
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
The dichotomy of minimum cost homomorphism problems for digraphs
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Monotone proper interval digraphs and Min-Max orderings
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics | 2013-03-12 | Paper |
| Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem | 2012-11-19 | Paper |
Approximation of minimum cost homomorphisms
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics | 2012-05-11 | Paper |
| Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs | 2010-06-07 | Paper |
Minimum cost homomorphism dichotomy for oriented cycles
Graphs and Combinatorics | 2010-01-18 | Paper |
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Minimum cost homomorphisms to semicomplete multipartite digraphs
Discrete Applied Mathematics | 2008-09-29 | Paper |
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics | 2008-05-13 | Paper |
Minimum Cost Homomorphisms to Reflexive Digraphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
The linear arrangement problem parameterized above guaranteed value
Theory of Computing Systems | 2007-12-19 | Paper |
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Lecture Notes in Computer Science | 2007-05-02 | Paper |
| \(C\)-perfect \(K\)-uniform hypergraphs. | 2007-03-29 | Paper |
Characterization of edge-colored complete graphs with properly colored Hamilton paths
Journal of Graph Theory | 2007-02-02 | Paper |
Hamilton cycles in digraphs of unitary matrices
Discrete Mathematics | 2006-12-14 | Paper |
| Multipartite tournaments with small number of cycles | 2006-09-13 | Paper |
On \(n\)-partite tournaments with unique \(n\)-cycle
Graphs and Combinatorics | 2006-09-12 | Paper |
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics | 2006-06-09 | Paper |
Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics | 2006-06-09 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2192158 (Why is no real title available?) | 2005-08-04 | Paper |
When n-cycles in n-partite tournaments are longest cycles
Discrete Mathematics | 2005-02-22 | Paper |
