2025
Broadcasting under Structural Restrictions.
CoRR, April, 2025
Interval Graphs are Reconstructible.
CoRR, April, 2025
Dichotomies for tree minor containment with structural parameters.
Theor. Comput. Sci., 2025
Structural parameterizations of vertex integrity.
Theor. Comput. Sci., 2025
An improved spectral lower bound of treewidth.
Inf. Process. Lett., 2025
Orientable burning number of graphs.
Discret. Appl. Math., 2025
2024
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.
Algorithmica, November, 2024
Computational complexity of jumping block puzzles.
Theor. Comput. Sci., February, 2024
Extended MSO Model Checking via Small Vertex Integrity.
Algorithmica, January, 2024
Grouped domination parameterized by vertex cover, twin cover, and beyond.
Theor. Comput. Sci., 2024
Collecting Balls on a Line by Robots with Limited Energy.
IEICE Trans. Inf. Syst., 2024
On a Spectral Lower Bound of Treewidth.
IEICE Trans. Inf. Syst., 2024
Finding a Reconfiguration Sequence between Longest Increasing Subsequences.
IEICE Trans. Inf. Syst., 2024
Computing diverse pair of solutions for tractable SAT.
CoRR, 2024
Parameterized Spanning Tree Congestion.
CoRR, 2024
On the Complexity of List H-Packing for Sparse Graph Classes.
Proceedings of the WALCOM: Algorithms and Computation, 2024
Finding Induced Subgraphs from Graphs with Small Mim-Width.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
2023
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci., November, 2023
Reconfiguration of cliques in a graph.
Discret. Appl. Math., July, 2023
Reconfiguring (non-spanning) arborescences.
Theor. Comput. Sci., 2023
Minimum Consistent Subset for Trees Revisited.
CoRR, 2023
Sequentially Swapping Tokens: Further on Graph Classes.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Grundy Distinguishes Treewidth from Pathwidth.
SIAM J. Discret. Math., September, 2022
Exploring the gap between treedepth and vertex cover through vertex integrity.
Theor. Comput. Sci., 2022
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.
Theory Comput. Syst., 2022
Finding shortest non-separating and non-disconnecting paths.
CoRR, 2022
Linear-Time Recognition of Double-Threshold Graphs.
Algorithmica, 2022
Parameterized Complexity of Graph Burning.
Algorithmica, 2022
Parameterized Complexity of (A, ℓ )-Path Packing.
Algorithmica, 2022
Reconfiguration of Regular Induced Subgraphs.
Proceedings of the WALCOM: Algorithms and Computation, 2022
Independent Set Reconfiguration on Directed Graphs.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Token Sliding on Split Graphs.
Theory Comput. Syst., 2021
Longest common subsequence in sublinear space.
Inf. Process. Lett., 2021
Low-congestion shortcut and graph parameters.
Distributed Comput., 2021
On the security number of the Cartesian product of graphs.
Discret. Appl. Math., 2021
Distributed Reconfiguration of Spanning Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021
Computational Complexity of Jumping Block Puzzles.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
Reconfiguring Directed Trees in a Digraph.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
Finding Diverse Trees, Paths, and More.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Efficient enumeration of maximal <i>k</i>-degenerate induced subgraphs of a chordal graph.
Theor. Comput. Sci., 2020
Space-Efficient Algorithms for Longest Increasing Subsequence.
Theory Comput. Syst., 2020
<i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense.
J. Inf. Process., 2020
Parameterized Complexity of Safe Set.
J. Graph Algorithms Appl., 2020
Symmetric assembly puzzles are hard, beyond a few pieces.
Comput. Geom., 2020
Parameterized Orientable Deletion.
Algorithmica, 2020
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Algorithmica, 2020
Independent Set Reconfiguration Parameterized by Modular-Width.
Algorithmica, 2020
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
A Survey on Spanning Tree Congestion.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
Hedonic Seat Arrangement Problems.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
2019
Reconfiguration of colorable sets in classes of perfect graphs.
Theor. Comput. Sci., 2019
On structural parameterizations of firefighting.
Theor. Comput. Sci., 2019
How Bad is the Freedom to Flood-It?
J. Graph Algorithms Appl., 2019
On Computational Complexity of Pipe Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
A lower bound on opaque sets.
Comput. Geom., 2019
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths.
Algorithmica, 2019
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
2018
Swapping colored tokens on graphs.
Theor. Comput. Sci., 2018
Vertex deletion problems on chordal graphs.
Theor. Comput. Sci., 2018
Safe sets in graphs: Graph classes and structural parameters.
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2018
A faster parameterized algorithm for Pseudoforest Deletion.
Discret. Appl. Math., 2018
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity.
Algorithmica, 2018
Induced Minor Free Graphs: Isomorphism and Clique-Width.
Algorithmica, 2018
Computational Complexity of Robot Arm Simulation Problems.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Exact Algorithms for the Max-Min Dispersion Problem.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018
2017
Alliances in graphs of bounded clique-width.
Discret. Appl. Math., 2017
Discret. Appl. Math., 2017
Ferrers dimension of grid intersection graphs.
Discret. Appl. Math., 2017
Extending Partial Representations of Interval Graphs.
Algorithmica, 2017
Extending Partial Representations of Proper and Unit Interval Graphs.
Algorithmica, 2017
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
2016
Finding a chain graph in a bipartite permutation graph.
Inf. Process. Lett., 2016
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.
Discret. Appl. Math., 2016
On the treewidth of toroidal grids.
Discret. Appl. Math., 2016
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom., 2016
Safe Sets in Graphs: Graph Classes and Structural Parameters.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Extending partial representations of subclasses of chordal graphs.
Theor. Comput. Sci., 2015
Linear-time algorithm for sliding tokens on trees.
Theor. Comput. Sci., 2015
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.
IEICE Trans. Inf. Syst., 2015
Completely independent spanning trees in (partial) <i>k</i>-trees.
Discuss. Math. Graph Theory, 2015
Swapping Colored Tokens on Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Competitive Diffusion on Weighted Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Sliding Token on Bipartite Permutation Graphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2014
Efficient algorithms for network localization using cores of underlying graphs.
Theor. Comput. Sci., 2014
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci., 2014
Base-object location problems for base-monotone regions.
Theor. Comput. Sci., 2014
Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discret. Appl. Math., 2014
Lower bounds for treewidth of product graphs.
Discret. Appl. Math., 2014
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR, 2014
Intersection Dimension of Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2014
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters.
Proceedings of the Algorithm Theory - SWAT 2014, 2014
Polynomial-Time Algorithm for Sliding Tokens on Trees.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Depth-First Search Using O(n) Bits.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
2013
The path-distance-width of hypercubes.
Discuss. Math. Graph Theory, 2013
Linear-time Algorithm for Partial Representation Extension of Interval Graphs.
CoRR, 2013
Base Location Problems for Base-Monotone Regions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Bounded Representations of Interval and Proper Interval Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2012
Efficient enumeration of ordered trees with k leaves.
Theor. Comput. Sci., 2012
Random generation and enumeration of bipartite permutation graphs.
J. Discrete Algorithms, 2012
Enumerating All Rooted Trees Including <i>k</i> Leaves.
IEICE Trans. Inf. Syst., 2012
On bipartite powers of bigraphs.
Discret. Math. Theor. Comput. Sci., 2012
Subgraph isomorphism in graph classes.
Discret. Math., 2012
Parameterized Complexity of the Spanning Tree Congestion Problem.
Algorithmica, 2012
On Complexity of Flooding Games on Graphs with Interval Representations.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.
J. Graph Algorithms Appl., 2011
Spanning tree congestion of rook's graphs.
Discuss. Math. Graph Theory, 2011
Bandwidth and pathwidth of three-dimensional grids.
Discret. Math., 2011
Spanning tree congestion of k-outerplanar graphs.
Discret. Math., 2011
On spanning tree congestion of Hamming graphs
CoRR, 2011
Approximability of the Path-Distance-Width for AT-free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
2010
The carving-width of generalized hypercubes.
Discret. Math., 2010
Complexity Results for the Spanning Tree Congestion Problem.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
2009
On spanning tree congestion of graphs.
Discret. Math., 2009
Security number of grid-like graphs.
Discret. Appl. Math., 2009
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
2008
A lower bound for the vertex boundary-width of complete k-ary trees.
Discret. Math., 2008
An improved algorithm for the longest induced path problem on k-chordal graphs.
Discret. Appl. Math., 2008
2007
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
Discret. Appl. Math., 2007