| Publication | Date of Publication | Type |
|---|
Approximations for the Steiner multicycle problem
Theoretical Computer Science | 2024-11-07 | Paper |
Finding large planar subgraphs and large subgraphs of a given genus
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Separating path systems in complete graphs | 2023-12-22 | Paper |
| Independent dominating sets in planar triangulations | 2023-08-04 | Paper |
Approximations for the Steiner multicycle problem
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
How heavy independent sets help to find arborescences with many leaves in DAGs
Journal of Computer and System Sciences | 2023-04-21 | Paper |
Complexity and approximability of minimum path-collection exact covers
Theoretical Computer Science | 2022-12-21 | Paper |
Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs
Combinatorial Theory | 2022-11-23 | Paper |
Leafy spanning arborescences in DAGs
Discrete Applied Mathematics | 2022-11-02 | Paper |
Leafy spanning arborescences in DAGs
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Leafy spanning \(k\)-forests
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
On the period collapse of a family of Ehrhart quasi-polynomials
(available as arXiv preprint) | 2021-04-22 | Paper |
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
Discrete & Computational Geometry | 2021-01-29 | Paper |
Transversals of longest paths
Discrete Mathematics | 2020-01-22 | Paper |
Prices of anarchy of selfish 2D bin packing games
International Journal of Foundations of Computer Science | 2019-06-21 | Paper |
Counting Hamiltonian cycles in the matroid basis graph
Graphs and Combinatorics | 2019-05-03 | Paper |
Approximation algorithms for the max-buying problem with limited supply
Algorithmica | 2019-01-11 | Paper |
On minimum bisection and related cut problems in trees and tree-like graphs
Journal of Graph Theory | 2018-10-31 | Paper |
| The online multicommodity connected facility location problem | 2018-06-22 | Paper |
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
Discrete Optimization | 2018-05-24 | Paper |
Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
Algorithmica | 2018-04-11 | Paper |
Transversals of longest paths
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
Nonempty intersection of longest paths in series-parallel graphs
Discrete Mathematics | 2016-12-22 | Paper |
| Trajectory clustering of points in \(\mathbb{R}\) | 2016-10-17 | Paper |
Approximating minimum \(k\)-section in trees with linear diameter
(available as arXiv preprint) | 2016-10-17 | Paper |
| On minimum bisection and related partition problems in graphs with bounded tree width | 2016-10-14 | Paper |
Kinetic clustering of points on the line
Theoretical Computer Science | 2016-06-30 | Paper |
Repetition-free longest common subsequence of random sequences
Discrete Applied Mathematics | 2016-06-22 | Paper |
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Spanning trees with nonseparating paths
Discrete Mathematics | 2015-10-08 | Paper |
| scientific article; zbMATH DE number 6472640 (Why is no real title available?) | 2015-08-14 | Paper |
Geodesic stability for memoryless binary long-lived consensus
Journal of Computer and System Sciences | 2015-07-13 | Paper |
| scientific article; zbMATH DE number 6303002 (Why is no real title available?) | 2014-06-11 | Paper |
Second-price ad auctions with binary bids and markets with good competition
Theoretical Computer Science | 2014-06-06 | Paper |
A MILP model for an extended version of the flexible job shop problem
Optimization Letters | 2014-04-30 | Paper |
Approximation algorithms for the max-buying problem with limited supply
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Intersecting longest paths
Discrete Mathematics | 2014-01-20 | Paper |
| Intersection of longest paths in a graph | 2013-11-01 | Paper |
Selfish square packing
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Stability in geodesics for memoryless binary long-lived consensus
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A concurrent implementation of skip graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Second-price ad auctions with binary bids and markets with good competition
Lecture Notes in Computer Science | 2012-11-02 | Paper |
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Maximum series-parallel subgraph
Algorithmica | 2012-04-26 | Paper |
| Edge-coloring series-parallel multigraphs | 2011-07-26 | Paper |
Approximating a class of combinatorial problems with rational objective function
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Repetition-free longest common subsequence
Discrete Applied Mathematics | 2010-08-13 | Paper |
| On the \(k\)-restricted structure ratio in planar and outerplanar graphs | 2010-07-27 | Paper |
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
Information Processing Letters | 2010-03-24 | Paper |
Maximum series-parallel subgraph
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics | 2009-03-04 | Paper |
Repetition-free longest common subsequence
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
Lecture Notes in Computer Science | 2008-04-15 | Paper |
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximating Rational Objectives Is as Easy as Approximating Linear Ones
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
From monomials to words to graphs.
Journal of Combinatorial Theory. Series A | 2004-08-06 | Paper |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms | 2004-03-14 | Paper |
A new approximation algorithm for finding heavy planar subgraphs
Algorithmica | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1688368 (Why is no real title available?) | 2002-01-09 | Paper |
| Multicuts in unweighted digraphs with bounded degree and bounded tree-width | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1187148 (Why is no real title available?) | 1999-04-08 | Paper |
A Better Approximation Algorithm for Finding Planar Subgraphs
Journal of Algorithms | 1998-01-01 | Paper |
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
Journal of Algorithms | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 871895 (Why is no real title available?) | 1996-06-16 | Paper |
