| Publication | Date of Publication | Type |
|---|
On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
Acta Informatica | 2026-02-20 | Paper |
| Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs | 2024-08-22 | Paper |
Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Further results on online node- and edge-deletion problems with advice
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks | 2022-07-01 | Paper |
On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
Algorithmica | 2022-06-28 | Paper |
Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Online node- and edge-deletion problems with advice
Algorithmica | 2021-09-02 | Paper |
| An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem | 2020-11-25 | Paper |
| scientific article; zbMATH DE number 7219313 (Why is no real title available?) | 2020-07-10 | Paper |
Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
Theoretical Computer Science | 2020-01-16 | Paper |
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Discrete Applied Mathematics | 2018-12-03 | Paper |
Fixed-parameter algorithms for Vertex Cover \(P_3\)
Discrete Optimization | 2018-05-24 | Paper |
Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
Journal of Computer and System Sciences | 2017-11-14 | Paper |
| The approximability of the \(p\)-hub center problem with parameterized triangle inequality | 2017-10-23 | Paper |
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Approximation algorithms for the star \(k\)-hub center problem in metric graphs
Lecture Notes in Computer Science | 2016-09-02 | Paper |
An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
Moderately exponential time algorithms for the maximum induced matching problem
Optimization Letters | 2015-07-22 | Paper |
Finding large \(k\)-clubs in undirected graphs
Computing | 2015-01-26 | Paper |
\(k\)-cographs are Kruskalian
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Exact algorithms for problems related to the densest \(k\)-set problem
Information Processing Letters | 2014-05-05 | Paper |
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics | 2013-01-18 | Paper |
Recognition of Probe Ptolemaic Graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Block-graph width
Theoretical Computer Science | 2011-05-18 | Paper |
| Black-and-white threshold graphs | 2011-04-19 | Paper |
Classifying rankwidth \(k\)-dh-graphs
Computer Science – Theory and Applications | 2010-06-22 | Paper |
On some simple widths
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Trivially-perfect width
Lecture Notes in Computer Science | 2009-12-11 | Paper |
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters | 2009-12-04 | Paper |
Block-Graph Width
Lecture Notes in Computer Science | 2009-06-03 | Paper |
