| Publication | Date of Publication | Type |
|---|
Computational complexity of covering disconnected multigraphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
Reconfiguration graph for vertex colourings of weakly chordal graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
| 2024-05-03 | Paper |
List covering of regular multigraphs with semi-edges
Algorithmica | 2024-03-25 | Paper |
scientific article; zbMATH DE number 7724194 (Why is no real title available?)
| 2023-08-08 | Paper |
Computational Complexity of Covering Disconnected Multigraphs
| 2023-06-10 | Paper |
Extending partial representations of circular-arc graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
List covering of regular multigraphs
| 2022-08-30 | Paper |
Computational complexity of covering disconnected multigraphs
| 2022-05-20 | Paper |
On edge-length ratios of partial 2-trees
International Journal of Computational Geometry & Applications | 2022-04-26 | Paper |
List covering of regular multigraphs with semi-edges
| 2022-04-08 | Paper |
On the Edge-Length Ratio of 2-Trees
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Reconfiguration graph for vertex colourings of weakly chordal graphs
Discrete Mathematics | 2020-01-22 | Paper |
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Parameterized complexity of distance labeling and uniform channel assignment problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
3-connected reduction for regular graph covers
European Journal of Combinatorics | 2018-08-24 | Paper |
Gaps in full homomorphism order
| 2018-01-18 | Paper |
Fractal property of the graph homomorphism order
European Journal of Combinatorics | 2017-09-11 | Paper |
An universality argument for graph homomorphisms
| 2016-10-14 | Paper |
Algorithmic Aspects of Regular Graph Covers
| 2016-09-10 | Paper |
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Theoretical Computer Science | 2015-06-10 | Paper |
Locally constrained graph homomorphisms -- structure, complexity, and applications
Computer Science Review | 2014-10-07 | Paper |
Universality of intervals of line graph order
European Journal of Combinatorics | 2014-09-02 | Paper |
Algorithmic aspects of regular graph covers with applications to planar graphs
Automata, Languages, and Programming | 2014-07-01 | Paper |
A note on contracting claw-free graphs
| 2014-02-14 | Paper |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Detecting induced star-like minors in polynomial time
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Dichotomy of the \(H\)-quasi-cover problem
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Distance three labelings of trees
Discrete Applied Mathematics | 2012-05-11 | Paper |
The \(k\)-in-a-path problem for claw-free graphs
Algorithmica | 2012-04-26 | Paper |
The \(k\)-in-a-path problem for claw-free graphs
| 2012-01-23 | Paper |
Parameterized complexity of coloring problems: treewidth versus vertex cover
Theoretical Computer Science | 2011-05-18 | Paper |
Comparing universal covers in polynomial time
Theory of Computing Systems | 2010-08-13 | Paper |
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics | 2010-05-25 | Paper |
The packing chromatic number of infinite product graphs
European Journal of Combinatorics | 2009-06-17 | Paper |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Complexity of the Packing Coloring Problem for Trees
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Comparing Universal Covers in Polynomial Time
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Block transitivity and degree matrices
European Journal of Combinatorics | 2008-05-29 | Paper |
Distance Constrained Labelings of Trees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics | 2008-05-13 | Paper |
On the computational complexity of partial covers of theta graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
Independence and Coloring Problems on Intersection Graphs of Disks
Lecture Notes in Computer Science | 2008-03-14 | Paper |
The subchromatic index of graphs
| 2008-02-28 | Paper |
scientific article; zbMATH DE number 5158488 (Why is no real title available?)
| 2007-05-29 | Paper |
Block transitivity and degree matrices
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Cantor--Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics | 2006-11-15 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
A Brooks-Type Theorem for the Generalized List T-Coloring
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A complete complexity classification of the role assignment problem
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Generalized list \(T\)-colorings of cycles
Discrete Applied Mathematics | 2005-05-04 | Paper |
New lower bounds on the weighted chromatic number of a graph
Discussiones Mathematicae Graph Theory | 2005-04-15 | Paper |
Systems of distant representatives
Discrete Applied Mathematics | 2005-02-22 | Paper |
On distance constrained labeling of disk graphs
Theoretical Computer Science | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2111730 (Why is no real title available?)
| 2004-10-28 | Paper |
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
Journal of Algorithms | 2004-09-08 | Paper |
scientific article; zbMATH DE number 2081019 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044507 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2044932 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2038757 (Why is no real title available?)
| 2004-02-08 | Paper |
Graph Subcolorings: Complexity and Algorithms
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1979516 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1974112 (Why is no real title available?)
| 2003-09-03 | Paper |
Partial covers of graphs
Discussiones Mathematicae Graph Theory | 2003-08-21 | Paper |
scientific article; zbMATH DE number 1953094 (Why is no real title available?)
| 2003-07-25 | Paper |
NP completeness of the edge precoloring extension problem on bipartite graphs
Journal of Graph Theory | 2003-06-25 | Paper |
scientific article; zbMATH DE number 1877050 (Why is no real title available?)
| 2003-04-03 | Paper |
On-line coloring of geometric intersection graphs
Computational Geometry | 2003-03-10 | Paper |
Fixed-parameter complexity of \(\lambda\)-labelings
Discrete Applied Mathematics | 2002-03-29 | Paper |
Computational complexity of covering cyclic graphs
Discrete Mathematics | 2002-01-17 | Paper |
scientific article; zbMATH DE number 1420920 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 784905 (Why is no real title available?)
| 1995-09-26 | Paper |
scientific article; zbMATH DE number 4208724 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 3666745 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3561265 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3416871 (Why is no real title available?)
| 1973-01-01 | Paper |
Axiomatic theory of investment evaluating
| 1971-01-01 | Paper |
Interpolation with prescribed values of derivatives instead of function values
| 1971-01-01 | Paper |
Zeroes of orthogonal polynomials by QD-algorithm
| 1969-01-01 | Paper |
A note on the integrals involving product of Hermite's polynomials
| 1966-01-01 | Paper |
scientific article; zbMATH DE number 3224677 (Why is no real title available?)
| 1965-01-01 | Paper |
Compact sets in locally convex spaces
| 1965-01-01 | Paper |
scientific article; zbMATH DE number 3210150 (Why is no real title available?)
| 1963-01-01 | Paper |
