| Publication | Date of Publication | Type |
|---|
Co-clustering under the maximum norm
Algorithms | 2019-03-26 | Paper |
Constant-factor approximations for capacitated arc routing without triangle inequality
Operations Research Letters | 2018-09-28 | Paper |
The complexity of degree anonymization by graph contractions
Information and Computation | 2017-09-28 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
Finding large degree-anonymous subgraphs is hard
Theoretical Computer Science | 2016-02-26 | Paper |
The complexity of degree anonymization by vertex addition
Theoretical Computer Science | 2015-12-08 | Paper |
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
The complexity of degree anonymization by graph contractions
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
A refined complexity analysis of degree anonymization in graphs
Information and Computation | 2015-06-09 | Paper |
The complexity of degree anonymization by vertex addition
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On structural parameterizations for the 2-club problem
Discrete Applied Mathematics | 2015-04-28 | Paper |
Parameterized algorithmics and computational experiments for finding 2-clubs
Journal of Graph Algorithms and Applications | 2015-04-22 | Paper |
On explaining integer vectors by few homogeneous segments
Journal of Computer and System Sciences | 2015-02-20 | Paper |
On structural parameterizations for the 2-club problem
Lecture Notes in Computer Science | 2014-11-04 | Paper |
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
The Complexity of Finding a Large Subgraph under Anonymity Constraints
Algorithms and Computation | 2014-01-14 | Paper |
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science | 2014-01-10 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithmica | 2013-11-11 | Paper |
On explaining integer vectors by few homogenous segments
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A refined complexity analysis of degree anonymization in graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Parameterized and Exact Computation | 2013-01-07 | Paper |
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Linear-time computation of a linear problem kernel for dominating set on planar graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithms and Computation | 2011-12-16 | Paper |
Incremental list coloring of graphs, parameterized by conservation
Lecture Notes in Computer Science | 2010-06-17 | Paper |
