Binary file (standard input)
matches
Christian
Komusiewicz
Hannes Moser
Rolf Niedermeier
|
|
Measuring Indifference:
Unit Interval Vertex Deletion.
In Proceedings of the 36th
International Workshop on Graph Theoretic Concepts in
Computer Science (WG'10), Binary
file (standard input) matches |
|
|
|
Frederic Dorn
Hannes Moser
Rolf Niedermeier
Mathias
Weller
|
|
Efficient Algorithms for
Eulerian Extension.
In Proceedings of the 36th
International Workshop on Graph Theoretic Concepts in
Computer Science (WG'10), Binary
file (standard input) matches |
|
|
|
Binary file (standard input)
matches
Hannes Moser
Rolf Niedermeier
|
|
Kernelization Through
Tidying—A Case Study Based on s-Plex Cluster
Vertex Deletion.
In Proceedings of the 9th Latin
American Theoretical Informatics Symposium
(LATIN'10), Binary
file (standard input) matches |
|
|
|
Michael R. Fellows
Jiong
Guo
Hannes Moser
Rolf Niedermeier
|
|
A Complexity Dichotomy for
Finding Disjoint Solutions of Vertex Deletion
Problems.
In Proceedings of the 34th
International Symposium on Mathematical Foundations of
Computer Science (MFCS'09),
Novy Smokovec, Slovakia. August 2009.
Volume 5734 in Lecture Notes in Computer Science, pages
319–330, Springer. |
|
|
|
Hannes
Moser
Rolf Niedermeier
Manuel Sorge
|
|
Algorithms and Experiments
for Clique Relaxations—Finding Maximum
s-Plexes.
In Proceedings of the 8th
International Symposium on Experimental Algorithms
(SEA'09), Dortmund,
Germany. June 2009.
Volume 5526 of Lecture Notes in Computer Science, pages
233–244, Springer. |
|
|
|
Binary
file (standard input) matches
Christian
Komusiewicz
Hannes Moser
|
|
On Generating
Triangle-Free Graphs.
In Proceedings of the DIMAP
Workshop on Algorithmic Graph Theory (AGT'09),
Warwick, England. March 2009.
Electronic Notes in Discrete Mathematics 32, pages
51–58, Elsevier. |
|
|
|
Michael R. Fellows
Jiong
Guo
Hannes Moser
Rolf Niedermeier
|
|
A Generalization of
Nemhauser and Trotter's Local Optimization
Theorem.
In Proceedings of the 26th
International Symposium on Theoretical Aspects of
Computer Science (STACS'09),
Binary file (standard input) matches |
|
|
|
Hannes
Moser
|
|
A Problem Kernelization
for Graph Packing.
In Proceedings of the 35th
International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM'09),
Špindlerův Mlýn, Czech Republic, January
2009.
Volume 5404 of Lecture Notes in Computer Science, pages
401–412, Springer. |
|
|
|
Falk
Hüffner
Christian
Komusiewicz
Hannes Moser
Rolf Niedermeier
|
|
Enumerating Isolated
Cliques in Synthetic and Financial Networks.
In Proceedings of the 2nd
Annual International Conference on Combinatorial
Optimization and Applications (COCOA'08),
St. John's, Newfoundland, Canada. August 2008.
Volume 5165 in Lecture Notes in Computer Science, pages
405–416, Springer. |
|
|
|
Falk
Hüffner
Christian
Komusiewicz
Hannes Moser
Rolf Niedermeier
|
|
Fixed-Parameter Algorithms
for Cluster Vertex Deletion.
In Proceedings of the 8th Latin
American Theoretical Informatics Symposium
(LATIN'08), Binary
file (standard input) matches |
|
|
|
Hannes
Moser
Venkatesh
Raman
Somnath
Sikdar
|
|
The Parameterized
Complexity of the Unique Coverage Problem.
In Proceedings of the 18th
International Symposium on Algorithms and
Computation (ISAAC'07),
Sendai, Japan. December 2007.
Volume 4835 in Lecture Notes in Computer Science, pages
621–631, Springer. |
|
|
|
Hannes
Moser
Somnath
Sikdar
|
|
The Parameterized
Complexity of the Induced Matching Problem in Planar
Graphs.
In Proceedings of the 2007
International Frontiers in Algorithmics Workshop
(FAW'07),
Lanzhou, China. August 2007.
Volume 4613 in Lecture Notes in Computer Science, pages
325–336, Springer. |
|
|
|
Christian
Komusiewicz
Falk
Hüffner
Hannes Moser
Rolf Niedermeier
|
|
Isolation Concepts for
Enumerating Dense Subgraphs.
In Proceedings of the 13th
International Computing and Combinatorics
Conference (COCOON'07),
Banff, Canada. July 2007.
Volume 4598 in Lecture Notes in Computer Science, pages
140–150, Springer. |
|
|
|
Hannes
Moser
Dimitrios M.
Thilikos
|
|
Parameterized Complexity
of Finding Regular Induced Subgraphs.
In Proceedings of the 2nd
Algorithms and Complexity in Durham workshop
(ACiD'06),
Durham, England, September 2006. In Texts in
Algorithmics, College Publications, 2006. |
|
|
|
Hannes
Moser
|
|
System J - Konzeption und
prototypische Umsetzung eines Praktikums zur
Datenbanksystementwicklung.
In Binary file (standard input)
matches (BTW'05),
Karlsruhe, Germany. March 2005. Pages
29–31. |
|
|
|