| Publication | Date of Publication | Type |
|---|
Color-constrained arborescences in edge-colored digraphs
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
| Packing Arc-disjoint 4-cycles in oriented graphs | 2024-09-12 | Paper |
Packing arc-disjoint cycles in oriented graphs
Journal of Computer and System Sciences | 2024-04-09 | Paper |
Improved bounds for the oriented radius of mixed multigraphs
Journal of Graph Theory | 2023-10-10 | Paper |
| Eternal vertex cover on bipartite graphs | 2022-11-11 | Paper |
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
Computer Science – Theory and Applications | 2022-10-19 | Paper |
A new lower bound for the eternal vertex cover number of graphs
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
On graphs whose eternal vertex cover number and vertex cover number coincide
Discrete Applied Mathematics | 2022-08-04 | Paper |
A substructure based lower bound for eternal vertex cover number
Theoretical Computer Science | 2021-10-21 | Paper |
An improvement to Chvátal and Thomassen's upper bound for oriented diameter
Discrete Applied Mathematics | 2021-09-30 | Paper |
A new lower bound for the eternal vertex cover number of graphs
Lecture Notes in Computer Science | 2021-04-21 | Paper |
| A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs | 2020-05-16 | Paper |
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks
(available as arXiv preprint) | 2020-01-14 | Paper |
On graphs with minimal eternal vertex cover number
(available as arXiv preprint) | 2019-10-10 | Paper |
On induced colourful paths in triangle-free graphs
Discrete Applied Mathematics | 2019-02-20 | Paper |
| Every property of outerplanar graphs is testable | 2018-04-19 | Paper |
On induced colourful paths in triangle-free graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Sublinear approximation algorithms for boxicity and related problems
Discrete Applied Mathematics | 2018-01-11 | Paper |
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
European Journal of Combinatorics | 2015-06-02 | Paper |
Rainbow matchings in strongly edge-colored graphs
Discrete Mathematics | 2015-04-01 | Paper |
Fixed-orientation equilateral triangle matching of point sets
Theoretical Computer Science | 2014-10-06 | Paper |
2-connecting outerplanar graphs without blowing up the pathwidth
Theoretical Computer Science | 2014-10-06 | Paper |
A constant factor approximation algorithm for boxicity of circular arc graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
2-connecting outerplanar graphs without blowing up the pathwidth
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Fixed-orientation equilateral triangle matching of point sets
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Polynomial time and parameterized approximation algorithms for boxicity
Parameterized and Exact Computation | 2013-01-07 | Paper |
Polynomial time and parameterized approximation algorithms for boxicity
Parameterized and Exact Computation | 2013-01-07 | Paper |
A constant factor approximation algorithm for boxicity of circular arc graphs
Lecture Notes in Computer Science | 2011-08-12 | Paper |
