dblp.uni-trier.dewww.uni-trier.de

Joachim Kneis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
14EELjiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR abs/0909.4224: (2009)
13EEHans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke: Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009)
2008
12EEJoachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281
11EEJoachim Kneis, Alexander Langer, Peter Rossmanith: Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251
2007
10EEJoachim Kneis, Daniel Mölle, Peter Rossmanith: Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376
9EEHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007)
2006
8EEHans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270
7EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607
6EEHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
5EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Divide-and-Color. WG 2006: 58-67
4EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006)
2005
3EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579
2EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396
2003
1EEJens Gerlach, Joachim Kneis: Generic Programming for Scientific Computing in C++, Java, and C#. APPT 2003: 301-310

Coauthor Index

1Hans-Joachim Böckenhauer [6] [8] [9] [13]
2Ljiljana Brankovic [14]
3Henning Fernau [14]
4Luca Forlizzi [8]
5Jens Gerlach [1]
6Juraj Hromkovic [6] [8] [9]
7Dieter Kratsch [14]
8Joachim Kupke [6] [8] [9] [13]
9Alexander Langer [11] [12] [14]
10Mathieu Liedloff [14]
11Daniel Mölle [2] [3] [4] [5] [7] [10]
12Guido Proietti [8]
13Daniel Raible [14]
14Stefan Richter [2] [3] [4] [5] [7]
15Peter Rossmanith [2] [3] [4] [5] [7] [10] [11] [12] [14]
16Peter Widmayer [8]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)