| Publication | Date of Publication | Type |
|---|
Exploring the gap between treedepth and vertex cover through vertex integrity
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-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 |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | 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 |
| How bad is the freedom to Flood-It? | 2020-08-11 | Paper |
Space-efficient algorithms for longest increasing subsequence
(available as arXiv preprint) | 2020-08-05 | Paper |
Space-efficient algorithms for longest increasing subsequence
Theory of Computing Systems | 2020-04-15 | Paper |
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
Theoretical Computer Science | 2020-01-16 | Paper |
On structural parameterizations of firefighting
Theoretical Computer Science | 2019-06-06 | Paper |
How Bad is the Freedom to Flood-It?
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
Finding a chain graph in a bipartite permutation graph
Information Processing Letters | 2016-05-18 | Paper |
On the treewidth of toroidal grids
Discrete Applied Mathematics | 2015-12-07 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
| scientific article; zbMATH DE number 6139736 (Why is no real title available?) | 2013-02-28 | Paper |
Bipartite permutation graphs are reconstructible
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
Bipartite Permutation Graphs Are Reconstructible
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Reconstruction of interval graphs
Theoretical Computer Science | 2010-11-11 | Paper |
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science | 2010-06-07 | Paper |
Reconstruction Algorithm for Permutation Graphs
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Reconstruction of Interval Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Random Generation and Enumeration of Proper Interval Graphs
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Listing Chordal Graphs and Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
Lecture Notes in Computer Science | 2008-07-10 | Paper |
| scientific article; zbMATH DE number 1759686 (Why is no real title available?) | 2002-08-06 | Paper |
| scientific article; zbMATH DE number 1741093 (Why is no real title available?) | 2002-05-15 | Paper |
