|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Courcelle's theorem - A game-theoretic approach.  |
Discrete Optimization  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith |
An exact algorithm for the Maximum Leaf Spanning Tree problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A New Algorithm for Finding Trees with Many Leaves. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Courcelle's Theorem - A Game-Theoretic Approach |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk |
Breaking the 2n-barrier for Irredundance: Two lines of attack. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis |
Intuitive algorithms. |
|
2009 |
RDF |
|
| 1 | Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke |
Approximation hardness of deadline-TSP reoptimization. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer |
A Practical Approach to Courcelle's Theorem. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ljiljana 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith |
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A Fine-grained Analysis of a Simple Independent Set Algorithm. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Improved Upper Bounds for Partial Vertex Cover. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
A New Algorithm for Finding Trees with Many Leaves. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer |
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. |
Algorithmic Operations Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke |
The Parameterized Approximability of TSP with Deadlines. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Peter Rossmanith |
Partial vs. Complete Domination: t-Dominating Set. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Parameterized power domination complexity. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Divide-and-Color. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke |
On the Approximation Hardness of Some Generalizations of TSP. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-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 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Intuitive Algorithms and t-Vertex Cover. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
Algorithms Based on the Treewidth of Sparse Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith |
On the Parameterized Complexity of Exact Satisfiability Problems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gerlach, Joachim Kneis |
Generic Programming for Scientific Computing in C++, Java, and C#. |
APPT |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")