| 2012 |
| Journal articles |
|
| 2011 |
| Conference articles |
-
:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.
In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), Nový Smokovec, Slovakia, 2011.
Volume 6543 in Lecture Notes in Computer Science, pages 123–134, Springer (original publication).
-
:
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs.
In Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11), Rome, Italy, 2011.
Volume 6595 in Lecture Notes in Computer Science, pages 104–115, Springer (original publication).
-
:
Alternative Parameterizations for Cluster Editing.
In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), Nový Smokovec, Slovakia, 2011.
Volume 6543 in Lecture Notes in Computer Science, pages 344–355, Springer (original publication).
|
| Journal articles |
|
| Thesis |
|
| 2010 |
| Conference articles |
-
:
Extended Islands of Tractability for Parsimony Haplotyping.
In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM'10), New York, USA, 2010.
Volume 6129 in Lecture Notes in Computer Science, pages 214–226, Springer (original publication).
-
:
Exact Algorithms and Experiments for Hierarchical Tree Clustering.
In Proceedings of the 24th AAAI Conference on Artificial Intelligence
(AAAI'10), Atlanta, USA, 2010 (original publication).
-
:
On Tractable Cases of Target Set Selection.
In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC '10), Part I, Jeju Island, Korea, 2010.
Volume 6506 in Lecture Notes in Computer Science, pages 378–389, Springer (original publication).
-
:
Two-Layer Planarization Parameterized by Feedback Edge Set.
In Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC'10), Prague, Czech Republic, 2010.
Volume 6108 in Lecture Notes in Computer Science, pages 431–442, Springer (original publication).
|
| Journal articles |
|
| 2009 |
| Conference articles |
-
Graph-Based Data Clustering with Overlaps.
In Proceedings of the 15th International Computing and Combinatorics Conference
(COCOON'09),
Niagara Falls, USA, 2009.
Volume 5609 in Lecture Notes in Computer Science, pages 516–526, Springer (original publication).
-
Editing Graphs into Disjoint Unions of Dense Clusters.
In Proceedings of the 20th International Symposium on Algorithms and Computation
(ISAAC'09), Hawaii, USA, 2009.
Volume 5878 in Lecture Notes in Computer Science, pages 583–593, Springer (original publication).
-
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.
In Proceedings of the 5th International Conference on
Algorithmic Aspects in Information and Management
(AAIM'09),
San Francisco, USA, 2009.
Volume 5564 in Lecture Notes in Computer Science, pages 226–239, Springer (original publication).
-
Deconstructing Intractability – A Case Study for Interval Constrained Coloring.
In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
(CPM'09), Lille, France, 2009.
Volume 5577 in Lecture Notes in Computer Science, pages 207–220, Springer (original publication).
-
On Making Directed Graphs Transitive.
In Proceedings of the 11th Algorithms and Data Structures Symposium WADS'09), Banff, Canada, 2009.
Volume 5664 in Lecture Notes in Computer Science, pages 542–553. Springer (original publication).
|
| Journal articles |
|
| 2008 |
| Conference articles |
|
| Journal articles |
|
| 2004–2007 |
| Conference articles |
-
Kernelization
and complexity results for connectivity augmentation problems.
In
Proceedings of the 10th Workshop on Algorithms and Data
Structures (WADS'07),
Halifax, Canada, 2007.
Volume 4619 in Lecture Notes in Computer Science, pages 484–495, Springer (original publication).
-
,
,
,
,
and Johannes Uhlmann:
Complexity
and exact algorithms for multicut.
In Proceedings of the
32nd International Conference on Current Trends in Theory and
Practice of Computer Science (SOFSEM'06), Merin, Czech Republic, 2006.
Volume 3831 in Lecture Notes in Computer Science, pages 303–312, Springer (original publication).
-
Tree decompositions of graphs: saving memory in dynamic programming.
In Proceedings of the Cologne Twente Workshop on Graphs and
Combinatorial Optimization (CTW'04),
Milano, Italy, 2004 .
|
| Journal articles |
|