| Publication | Date of Publication | Type |
|---|
| On computational aspects of ordered matching problems | 2026-03-20 | Paper |
Taming graphs with no large creatures and skinny ladders
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
| Sparse induced subgraphs in \(P_6\)-free graphs | 2024-11-28 | Paper |
| Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws | 2024-09-11 | Paper |
| List locally surjective homomorphisms in hereditary graph classes | 2024-09-11 | Paper |
| Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds | 2024-07-19 | Paper |
| Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws | 2024-07-19 | Paper |
| Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument | 2024-06-24 | Paper |
Induced subgraphs of bounded treewidth and the container method
SIAM Journal on Computing | 2024-06-05 | Paper |
Classifying subset feedback vertex set for \(H\)-free graphs
Theoretical Computer Science | 2024-06-04 | Paper |
| Quasi-polynomial-time algorithm for independent set in \(P_t\)-free graphs via shrinking the space of induced paths | 2024-05-14 | Paper |
List covering of regular multigraphs with semi-edges
Algorithmica | 2024-03-25 | Paper |
Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Towards the Chen-Raspaud conjecture
Discrete Mathematics | 2024-01-17 | Paper |
scientific article; zbMATH DE number 7788454 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Sparsification lower bounds for list \(H\)-coloring
(available as arXiv preprint) | 2023-11-14 | Paper |
Clique‐width: Harnessing the power of atoms
Journal of Graph Theory | 2023-11-06 | Paper |
| A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number | 2023-10-17 | Paper |
| scientific article; zbMATH DE number 7740892 (Why is no real title available?) | 2023-09-20 | Paper |
Every graph is eventually Turán-good
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
| Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs | 2023-08-08 | Paper |
| Sparse induced subgraphs in P_6-free graphs | 2023-07-14 | Paper |
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
Discrete & Computational Geometry | 2023-06-12 | Paper |
Complexity of \(C_k\)-coloring in hereditary classes of graphs
Information and Computation | 2023-05-19 | Paper |
Classifying subset feedback vertex set for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Computing list homomorphisms in geometric intersection graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Computing list homomorphisms in geometric intersection graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Algorithmica | 2023-04-11 | Paper |
scientific article; zbMATH DE number 7651213 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650231 (Why is no real title available?) | 2023-02-03 | Paper |
Clique-width: harnessing the power of atoms
(available as arXiv preprint) | 2022-12-21 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Journal of the ACM | 2022-12-08 | Paper |
Faster 3-coloring of small-diameter graphs
SIAM Journal on Discrete Mathematics | 2022-09-21 | Paper |
List covering of regular multigraphs
(available as arXiv preprint) | 2022-08-30 | Paper |
| Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws | 2022-05-26 | Paper |
Exact and approximation algorithms for sensor placement against DDoS attacks
International Journal of Applied Mathematics and Computer Science | 2022-05-23 | Paper |
scientific article; zbMATH DE number 7525468 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
scientific article; zbMATH DE number 7525509 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2022-05-02 | Paper |
Constant congestion brambles in directed graphs
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
List covering of regular multigraphs with semi-edges
(available as arXiv preprint) | 2022-04-08 | Paper |
| Max Weight Independent Set in graphs with no long claws: An analog of the Gy\'arf\'as' path argument | 2022-03-09 | Paper |
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
Subexponential-time algorithms for finding large induced sparse subgraphs
Algorithmica | 2021-07-26 | Paper |
| Coloring squares of planar graphs with small maximum degree | 2021-05-24 | Paper |
Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
SIAM Journal on Computing | 2021-04-14 | Paper |
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Representing graphs and hypergraphs by touching polygons in 3D
(available as arXiv preprint) | 2020-10-26 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Algorithmica | 2020-10-12 | Paper |
QPTAS and subexponential algorithm for maximum clique on disk graphs
(available as arXiv preprint) | 2020-08-18 | Paper |
| scientific article; zbMATH DE number 7228418 (Why is no real title available?) | 2020-08-05 | Paper |
Clique-Width: Harnessing the Power of Atoms
(available as arXiv preprint) | 2020-06-05 | Paper |
Complexity of $C_k$-coloring in hereditary classes of graphs
(available as arXiv preprint) | 2020-05-04 | Paper |
\( L ( 2 , 1 )\)-labeling of disk intersection graphs
Discrete Applied Mathematics | 2020-03-23 | Paper |
Subexponential algorithms for variants of the homomorphism problem in string graphs
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Subexponential algorithms for variants of homomorphism problem in string graphs
(available as arXiv preprint) | 2020-02-24 | Paper |
Complete colourings of hypergraphs
Discrete Mathematics | 2019-12-17 | Paper |
Finding small-width connected path decompositions in polynomial time
Theoretical Computer Science | 2019-10-16 | Paper |
\(H\)-colouring \(P_t\)-free graphs in subexponential time
Discrete Applied Mathematics | 2019-09-05 | Paper |
Packing Directed Cycles Quarter- and Half-Integrally
(available as arXiv preprint) | 2019-07-04 | Paper |
Optimality program in segment and string graphs
Algorithmica | 2019-05-21 | Paper |
| Fine-grained complexity of coloring unit disks and balls | 2019-02-27 | Paper |
Tight Euler tours in uniform hypergraphs -- computational aspects
(available as arXiv preprint) | 2018-12-10 | Paper |
| Tight Euler tours in uniform hypergraphs -- computational aspects | 2018-12-10 | Paper |
\(\forall\exists\mathbb {R}\)-completeness and area-universality
(available as arXiv preprint) | 2018-11-22 | Paper |
Optimality program in segment and string graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Homothetic polygons and beyond: maximal cliques in intersection graphs
Discrete Applied Mathematics | 2018-09-06 | Paper |
| Fine-grained complexity of coloring unit disks and balls | 2018-08-13 | Paper |
Complexity of token swapping and its variants
Algorithmica | 2018-07-26 | Paper |
Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
SIAM Journal on Discrete Mathematics | 2018-06-15 | Paper |
| Intersecting edge distinguishing colorings of hypergraphs | 2018-04-27 | Paper |
Complexity of token swapping and its variants
(available as arXiv preprint) | 2018-04-19 | Paper |
Achromatic and harmonious colorings of circulant graphs
Journal of Graph Theory | 2018-02-23 | Paper |
Fixing improper colorings of graphs
Theoretical Computer Science | 2018-02-16 | Paper |
| Designing RNA Secondary Structures is Hard | 2017-10-31 | Paper |
Harmonious and achromatic colorings of fragmentable hypergraphs
European Journal of Combinatorics | 2017-09-11 | Paper |
Harmonious coloring of uniform hypergraphs
Applicable Analysis and Discrete Mathematics | 2017-07-19 | Paper |
On edge intersection graphs of paths with 2 bends
Discrete Applied Mathematics | 2017-06-14 | Paper |
On edge intersection graphs of paths with 2 bends
Discrete Applied Mathematics | 2017-06-14 | Paper |
Erratum: Constructing Optimal $k$-Radius Sequences
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Sequences of radius \(k\) for complete bipartite graphs
Discrete Applied Mathematics | 2017-05-12 | Paper |
Sequences of radius \(k\) for complete bipartite graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
On edge intersection graphs of paths with 2 bends
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Harmonious and achromatic colorings of fragmentable hypergraphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Constructing optimal \(k\)-radius sequences
SIAM Journal on Discrete Mathematics | 2016-04-04 | Paper |
Fixing improper colorings of graphs
Lecture Notes in Computer Science | 2015-02-20 | 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 |
Exact algorithm for graph homomorphism and locally injective graph homomorphism
Information Processing Letters | 2014-04-17 | 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 |
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 |
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
(available as arXiv preprint) | N/A | Paper |
Minimal obstructions to $C_5$-coloring in hereditary graph classes
(available as arXiv preprint) | N/A | Paper |
Excluding a clique or a biclique in graphs of bounded induced matching treewidth
(available as arXiv preprint) | N/A | Paper |
