| Publication | Date of Publication | Type |
|---|
An improved spectral lower bound of treewidth
Information Processing Letters | 2025-01-14 | Paper |
Dichotomies for tree minor containment with structural parameters
Theoretical Computer Science | 2025-01-08 | Paper |
Structural parameterizations of vertex integrity
Theoretical Computer Science | 2024-12-12 | Paper |
Algorithmic meta-theorems for combinatorial reconfiguration revisited
Algorithmica | 2024-10-24 | Paper |
Extended MSO model checking via small vertex integrity
| 2024-09-11 | Paper |
Parameterized complexity of non-separating and non-disconnecting paths and sets
| 2024-08-06 | Paper |
Independent set reconfiguration on directed graphs
| 2024-08-06 | Paper |
Orientable burning number of graphs
| 2024-07-19 | Paper |
Dichotomies for tree minor containment with structural parameters
| 2024-07-19 | Paper |
Structural parameterizations of vertex integrity (best paper)
| 2024-07-19 | Paper |
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
| 2024-07-19 | Paper |
Sorting balls and water: equivalence and computational complexity
| 2024-05-16 | Paper |
Grouped domination parameterized by vertex cover, twin cover, and beyond
Theoretical Computer Science | 2024-04-04 | Paper |
Extended MSO model checking via small vertex integrity
Algorithmica | 2024-01-09 | Paper |
Computational complexity of jumping block puzzles
Theoretical Computer Science | 2024-01-05 | Paper |
Parameterized Complexity of Graph Burning
| 2023-11-13 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 2023-10-12 | Paper |
Grouped domination parameterized by vertex cover, twin cover, and beyond
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Sequentially swapping tokens: further on graph classes
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Reconfiguration of cliques in a graph
Discrete Applied Mathematics | 2023-04-27 | Paper |
Computational complexity of jumping block puzzles
| 2023-03-30 | Paper |
Reconfiguring directed trees in a digraph
| 2023-03-30 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Grundy distinguishes treewidth from pathwidth
| 2023-02-07 | Paper |
Low-congestion shortcut and graph parameters
| 2023-02-03 | Paper |
Reconfiguring (non-spanning) arborescences
Theoretical Computer Science | 2023-01-05 | Paper |
Linear-time recognition of double-threshold graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
A Survey on Spanning Tree Congestion
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Grundy Distinguishes Treewidth from Pathwidth
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
Parameterized complexity of graph burning
Algorithmica | 2022-08-03 | Paper |
Token sliding on split graphs
| 2022-07-18 | Paper |
Reconfiguration of regular induced subgraphs
| 2022-07-13 | Paper |
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science | 2022-05-10 | Paper |
An improved deterministic parameterized algorithm for cactus vertex deletion
Theory of Computing Systems | 2022-05-09 | Paper |
Independent set reconfiguration on directed graphs
| 2022-03-24 | Paper |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | Paper |
Linear-time recognition of double-threshold graphs
Algorithmica | 2022-03-22 | Paper |
Low-congestion shortcut and graph parameters
Distributed Computing | 2021-11-08 | Paper |
On the security number of the Cartesian product of graphs
Discrete Applied Mathematics | 2021-09-30 | Paper |
Token sliding on split graphs
Theory of Computing Systems | 2021-08-05 | Paper |
Alliances in graphs of bounded clique-width
Discrete Applied Mathematics | 2021-06-07 | Paper |
Longest common subsequence in sublinear space
Information Processing Letters | 2021-03-11 | Paper |
Vertex deletion problems on chordal graphs
| 2020-11-25 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry | 2020-10-23 | Paper |
Parameterized complexity of safe set
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Independent set reconfiguration parameterized by modular-width
Algorithmica | 2020-09-03 | Paper |
Parameterized orientable deletion
| 2020-08-25 | Paper |
Reconfiguration of Colorable Sets in Classes of Perfect Graphs
| 2020-08-25 | Paper |
How bad is the freedom to Flood-It?
| 2020-08-11 | Paper |
Space-efficient algorithms for longest increasing subsequence
| 2020-08-05 | Paper |
Exact algorithms for the max-min dispersion problem
| 2020-07-07 | Paper |
Parameterized orientable deletion
Algorithmica | 2020-05-21 | Paper |
Space-efficient algorithms for longest increasing subsequence
Theory of Computing Systems | 2020-04-15 | Paper |
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Theoretical Computer Science | 2020-04-07 | Paper |
Independent set reconfiguration parameterized by modular-width
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Parameterized complexity of safe set
| 2020-02-06 | Paper |
A lower bound on opaque sets
Computational Geometry | 2019-10-18 | Paper |
Linear-Time Recognition of Double-Threshold Graphs
| 2019-09-20 | Paper |
On structural parameterizations of firefighting
Theoretical Computer Science | 2019-06-06 | Paper |
Reconfiguration of colorable sets in classes of perfect graphs
Theoretical Computer Science | 2019-05-17 | Paper |
On the classes of interval graphs of limited nesting and count of lengths
Algorithmica | 2019-04-25 | Paper |
How Bad is the Freedom to Flood-It?
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Safe sets in graphs: graph classes and structural parameters
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Vertex deletion problems on chordal graphs
Theoretical Computer Science | 2018-09-24 | Paper |
Computational complexity of robot arm simulation problems
| 2018-09-06 | Paper |
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
Algorithmica | 2018-07-25 | Paper |
Swapping colored tokens on graphs
Theoretical Computer Science | 2018-05-17 | Paper |
On the classes of interval graphs of limited nesting and count of lengths
| 2018-04-19 | Paper |
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
| 2018-04-19 | Paper |
A faster parameterized algorithm for pseudoforest deletion
| 2018-04-10 | Paper |
Induced minor free graphs: isomorphism and clique-width
Algorithmica | 2018-02-28 | Paper |
A lower bound on opaque sets
| 2018-01-30 | Paper |
A faster parameterized algorithm for pseudoforest deletion
Discrete Applied Mathematics | 2018-01-11 | Paper |
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
| 2017-10-23 | Paper |
Extending partial representations of interval graphs
Algorithmica | 2017-10-09 | Paper |
Extending partial representations of proper and unit interval graphs
Algorithmica | 2017-05-02 | Paper |
Safe sets in graphs: graph classes and structural parameters
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Ferrers dimension of grid intersection graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Thin strip graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Induced minor free graphs: isomorphism and clique-width
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Finding a chain graph in a bipartite permutation graph
Information Processing Letters | 2016-05-18 | Paper |
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Computational Geometry | 2016-01-18 | Paper |
Sliding token on bipartite permutation graphs
Algorithms and Computation | 2016-01-11 | Paper |
Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
On the treewidth of toroidal grids
Discrete Applied Mathematics | 2015-12-07 | Paper |
Swapping Colored Tokens on Graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Competitive diffusion on weighted graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Reconfiguration of cliques in a graph
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Linear-time algorithm for sliding tokens on trees
Theoretical Computer Science | 2015-09-16 | Paper |
Polynomial-time algorithm for sliding tokens on trees
Algorithms and Computation | 2015-09-11 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
Completely independent spanning trees in (partial) \(k\)-trees
Discussiones Mathematicae Graph Theory | 2015-08-04 | Paper |
Extending partial representations of subclasses of chordal graphs
Theoretical Computer Science | 2015-05-18 | Paper |
Base-object location problems for base-monotone regions
Theoretical Computer Science | 2014-10-06 | Paper |
Efficient algorithms for network localization using cores of underlying graphs
Theoretical Computer Science | 2014-09-18 | Paper |
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
Extending partial representations of proper and unit interval graphs
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Theoretical Computer Science | 2014-07-07 | Paper |
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Intersection dimension of bipartite graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
On bipartite powers of bigraphs
| 2014-03-25 | Paper |
Bounded representations of interval and proper interval graphs
Algorithms and Computation | 2014-01-14 | Paper |
Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes
Algorithms and Computation | 2014-01-14 | Paper |
On complexity of flooding games on graphs with interval representations
Computational Geometry and Graphs | 2013-12-06 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
The path-distance-width of hypercubes
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
Base Location Problems for Base-Monotone Regions
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Isomorphism for graphs of bounded connected-path-distance-width
Algorithms and Computation | 2013-03-21 | Paper |
Extending Partial Representations of Subclasses of Chordal Graphs
Algorithms and Computation | 2013-03-21 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Algorithms and Computation | 2013-03-21 | Paper |
Parameterized complexity of the spanning tree congestion problem
Algorithmica | 2012-11-21 | Paper |
Subgraph isomorphism in graph classes
Discrete Mathematics | 2012-10-16 | Paper |
Spanning tree congestion of rook's graphs
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
Designing low-congestion networks with structural graph theory
Interdisciplinary Information Sciences (IIS) | 2012-09-05 | Paper |
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Efficient enumeration of ordered trees with \(k\) leaves
Theoretical Computer Science | 2012-08-08 | Paper |
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Approximability of the path-distance-width for AT-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Spanning tree congestion of \(k\)-outerplanar graphs
Discrete Mathematics | 2011-05-16 | Paper |
Bandwidth and pathwidth of three-dimensional grids
Discrete Mathematics | 2011-05-10 | Paper |
Complexity results for the spanning tree congestion problem
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
The carving-width of generalized hypercubes
Discrete Mathematics | 2010-10-19 | Paper |
Security number of grid-like graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Random Generation and Enumeration of Bipartite Permutation Graphs
Algorithms and Computation | 2009-12-17 | Paper |
On spanning tree congestion of graphs
Discrete Mathematics | 2009-12-10 | Paper |
An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
Discrete Applied Mathematics | 2009-03-09 | Paper |
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
A lower bound for the vertex boundary-width of complete \(k\)-ary trees
Discrete Mathematics | 2008-05-13 | Paper |
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Discrete Applied Mathematics | 2007-10-29 | Paper |
An improved spectral lower bound of treewidth
| N/A | Paper |
