| Publication | Date of Publication | Type |
|---|
| Computing distances on graph associahedra is fixed-parameter tractable | 2026-09-29 | Paper |
A tight quasi-polynomial bound for global label min-cut
ACM Transactions on Algorithms | 2026-07-17 | Paper |
| On the complexity of the median and closest permutation problems | 2026-02-13 | Paper |
Near-bipartiteness on graphs having small dominating sets
Journal of Combinatorial Optimization | 2026-01-23 | Paper |
Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
(available as arXiv preprint) | 2026-01-01 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2025-06-19 | Paper |
Sparse vertex cutsets and the maximum degree
The Electronic Journal of Combinatorics | 2025-05-30 | Paper |
Helly and strong Helly numbers of B_k-EPG and B_k-VPG graphs
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
Ars Mathematica Contemporanea | 2025-04-16 | Paper |
| Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄ (extended abstract) | 2025-04-08 | Paper |
Induced tree covering and the generalized Yutsis property
Journal of Computer and System Sciences | 2025-03-26 | Paper |
On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes
Theoretical Computer Science | 2025-02-18 | Paper |
Exact and parameterized algorithms for the independent cutset problem
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Taming graphs with no large creatures and skinny ladders
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Canonical cuts of path powers
Contributions to Discrete Mathematics | 2024-11-20 | Paper |
| Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets | 2024-09-16 | Paper |
| Twin-treewidth: a single-exponential logic-based approach | 2024-09-16 | Paper |
On conflict-free cuts: algorithms and complexity
Information Processing Letters | 2024-09-11 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
| Decoding tree decompositions from permutations | 2024-05-31 | Paper |
| Induced tree covering and the generalized Yutsis property | 2024-05-31 | Paper |
| Simple and tight complexity lower bounds for solving Rabin games | 2024-05-29 | Paper |
| Conditional lower bounds for sparse parameterized 2-CSP: a streamlined proof | 2024-05-29 | Paper |
| A tight quasi-polynomial bound for \textsc{Global Label Min-Cut} | 2024-05-14 | Paper |
Aspects of the complexity of (,)-coloring
Matemática Contemporânea | 2024-04-25 | Paper |
Generation of minimal obstructions of graphs-(2,1)
Matemática Contemporânea | 2024-04-22 | Paper |
Connecting terminals using at most one router
Matemática Contemporânea | 2024-04-22 | Paper |
Locality sensitive algotrithms for data mule routing problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄
The Electronic Journal of Combinatorics | 2024-02-23 | Paper |
A general framework for path convexities
Lecture Notes in Computer Science | 2024-02-23 | Paper |
Closing the complexity gap of the double distance problem
(available as arXiv preprint) | 2024-01-01 | Paper |
Linear‐time algorithms for eliminating claws in graphs
International Transactions in Operational Research | 2023-11-29 | Paper |
| On the Complexity of the Median and Closest Permutation Problems | 2023-11-28 | Paper |
On the complexity of coloring ‐graphs
International Transactions in Operational Research | 2023-11-23 | Paper |
| On Conflict-Free Cuts: Algorithms and Complexity | 2023-11-02 | Paper |
Recognizing well-dominated graphs is coNP-complete
Information Processing Letters | 2023-10-12 | Paper |
| Connecting constructive notions of ordinals in homotopy type theory | 2023-08-08 | Paper |
Partitioning P₄-tidy graphs into a stable set and a forest
Discrete Applied Mathematics | 2023-08-02 | Paper |
| Exact and Parameterized Algorithms for the Independent Cutset Problem | 2023-07-05 | Paper |
A Survey on the Complexity of Flood-Filling Games
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Reducing the vertex cover number via edge contractions
Journal of Computer and System Sciences | 2023-06-12 | Paper |
On the computational difficulty of the terminal connection problem
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
On conflict-free spanning tree: algorithms and complexity
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
On the minimum cycle cover problem on graphs with bounded co-degeneracy
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Sparse vertex cutsets and the maximum degree | 2023-04-20 | Paper |
| On the probe problem for (r, )-well-coveredness | 2023-03-30 | Paper |
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.
(available as arXiv preprint) | 2023-02-03 | Paper |
Computing the largest bond of a graph
(available as arXiv preprint) | 2023-02-03 | Paper |
Partitions and well-coveredness: the graph sandwich problem
Discrete Mathematics | 2023-01-17 | Paper |
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
Discrete Applied Mathematics | 2022-11-02 | Paper |
| Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques | 2022-10-13 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
(available as arXiv preprint) | 2022-10-13 | Paper |
On the computational complexity of the bipartizing matching problem
Annals of Operations Research | 2022-09-26 | Paper |
On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
Theoretical Computer Science | 2022-09-16 | Paper |
\(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
Discrete Applied Mathematics | 2022-09-15 | Paper |
Computing the best-case energy complexity of satisfying assignments in monotone circuits
Theoretical Computer Science | 2022-09-14 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
(available as arXiv preprint) | 2022-08-30 | Paper |
| Reducing graph transversals via edge contractions | 2022-07-18 | Paper |
A general framework for path convexities
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
| Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case | 2022-07-01 | Paper |
| Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes | 2022-06-29 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2022-05-02 | Paper |
| \(P_3\)-hull number of graphs with diameter two | 2022-04-27 | Paper |
| Even-power of cycles with many vertices are type 1 total colorable | 2022-04-27 | Paper |
| On the terminal connection problem | 2022-03-24 | Paper |
Computing the zig-zag number of directed graphs
Discrete Applied Mathematics | 2022-03-24 | Paper |
Finding the maximum multi improvement on neighborhood exploration
Optimization Letters | 2022-01-21 | Paper |
Partitioning a graph into complementary subgraphs
Graphs and Combinatorics | 2021-07-28 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Linear-time algorithms for eliminating claws in graphs
(available as arXiv preprint) | 2021-04-21 | Paper |
Computing the largest bond and the maximum connected cut of a graph
Algorithmica | 2021-04-19 | Paper |
Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The complexity of Helly-B₁ EPG graph recognition
(available as arXiv preprint) | 2021-01-05 | Paper |
| An efficient algorithm for combining verification and validation methods | 2020-10-22 | Paper |
Partitioning a graph into complementary subgraphs
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Maximum cuts in edge-colored graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
A multivariate analysis of the strict terminal connection problem
Journal of Computer and System Sciences | 2020-03-26 | Paper |
| Bipartizing with a matching | 2019-10-11 | Paper |
Deadlock resolution in wait-for graphs by vertex/arc deletion
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
FPT algorithms to recognize well covered graphs
(available as arXiv preprint) | 2019-05-23 | Paper |
| FPT algorithms to recognize well covered graphs | 2019-05-23 | Paper |
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
(available as arXiv preprint) | 2018-12-10 | Paper |
| Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs | 2018-12-10 | Paper |
| Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem | 2018-10-04 | Paper |
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Theoretical Computer Science | 2018-09-27 | Paper |
And/or-convexity: a graph convexity based on processes and deadlock models
Annals of Operations Research | 2018-06-12 | Paper |
Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
Discrete Applied Mathematics | 2018-05-24 | Paper |
| Simple undirected two-commodity integral flow with a unitary demand | 2018-04-09 | Paper |
Maximum cuts in edge-colored graphs
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
On the hardness of finding the geodetic number of a subcubic graph
Information Processing Letters | 2018-04-05 | Paper |
| Deletion graph problems based on deadlock resolution | 2017-10-23 | Paper |
Generalized threshold processes on graphs
Theoretical Computer Science | 2017-09-07 | Paper |
Decycling with a matching
Information Processing Letters | 2017-06-13 | Paper |
Extremal values and bounds for the zero forcing number
Discrete Applied Mathematics | 2016-09-30 | Paper |
Maximum induced matchings close to maximum matchings
Theoretical Computer Science | 2015-06-11 | Paper |
On \(P_{3}\)-convexity of graphs with bounded degree
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
| scientific article; zbMATH DE number 6423757 (Why is no real title available?) | 2015-04-09 | Paper |
