| Publication | Date of Publication | Type |
|---|
| Coloring and recognizing mixed interval graphs | 2025-07-24 | Paper |
Partial packing coloring and quasi-packing coloring of the triangular grid
Discrete Mathematics | 2024-12-02 | Paper |
Online coloring of disk graphs
Theoretical Computer Science | 2024-11-07 | Paper |
Coloring distance graphs on the plane
Discrete Mathematics | 2023-05-15 | Paper |
| Online coloring of disk graphs | 2022-06-29 | Paper |
Exact and approximation algorithms for sensor placement against DDoS attacks
International Journal of Applied Mathematics and Computer Science | 2022-05-23 | Paper |
Fractional meanings of nonrepetitiveness
Journal of Combinatorial Theory. Series A | 2022-04-01 | Paper |
Strong chromatic index of \(K_{1, t}\)-free graphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
\( L ( 2 , 1 )\)-labeling of disk intersection graphs
Discrete Applied Mathematics | 2020-03-23 | Paper |
Bundling all shortest paths
Discrete Applied Mathematics | 2020-03-23 | Paper |
Homothetic polygons and beyond: maximal cliques in intersection graphs
Discrete Applied Mathematics | 2018-09-06 | Paper |
Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
SIAM Journal on Discrete Mathematics | 2018-06-15 | Paper |
Upper bound on the circular chromatic number of the plane
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Fixing improper colorings of graphs
Theoretical Computer Science | 2018-02-16 | Paper |
First non-trivial upper bound on circular chromatic number of the plane
(available as arXiv preprint) | 2016-10-14 | Paper |
Fractional and \(j\)-fold coloring of the plane
Discrete & Computational Geometry | 2016-05-12 | Paper |
| Counting independent sets via Divide Measure and Conquer method | 2015-03-28 | Paper |
Fastest, average and quantile schedule
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Fixing improper colorings of graphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Exact and approximation algorithms for a soft rectangle packing problem
Optimization | 2014-10-24 | Paper |
An exact algorithm for the generalized list \(T\)-coloring problem
(available as arXiv preprint) | 2014-07-01 | Paper |
| An exact algorithm for the generalized list \(T\)-coloring problem | 2014-07-01 | Paper |
Determining the \(L(2,1)\)-span in polynomial space
Discrete Applied Mathematics | 2014-04-22 | Paper |
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science | 2014-01-16 | Paper |
On the complexity of exact algorithm for L(2,1)-labeling of graphs
Information Processing Letters | 2013-04-04 | Paper |
Beyond homothetic polygons: recognition and maximum clique
Algorithms and Computation | 2013-03-21 | Paper |
On the number of 2-packings in a connected graph
Discrete Mathematics | 2012-11-15 | Paper |
Determining the \(L(2,1)\)-span in polynomial space
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Counting Maximal Independent Sets in Subcubic Graphs
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Game chromatic number of graphs with locally bounded number of cycles
Information Processing Letters | 2012-03-27 | Paper |
Counting independent sets in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Fast exact algorithm for \(L(2,1)\)-labeling of graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On improved exact algorithms for \(L(2,1)\)-labeling of graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Combinatorial lemmas for oriented complexes
Topological Methods in Nonlinear Analysis | 2009-06-23 | Paper |
Combinatorial lemmas for polyhedrons I
Discussiones Mathematicae Graph Theory | 2008-01-18 | Paper |
Combinatorial Lemmas for Polyhedrons
Discussiones Mathematicae Graph Theory | 2005-09-12 | Paper |
Coloring of G<sup>2</sup>-G, for Euclidesian graph G
Discussiones Mathematicae Graph Theory | 2005-09-12 | Paper |
Combinatorial lemmas for nonoriented pseudomanifolds
Topological Methods in Nonlinear Analysis | 2004-03-29 | Paper |
