default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Kneis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Robert Ganian
, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? J. Comb. Theory B 116: 250-286 (2016)- 2014
- [j10]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014) - 2011
- [j9]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61(4): 882-897 (2011) - [j8]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's theorem - A game-theoretic approach. Discret. Optim. 8(4): 568-594 (2011) - [j7]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 9(3): 214-230 (2011) - [j6]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. 412(45): 6290-6302 (2011) - [i3]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's Theorem - A Game-Theoretic Approach. CoRR abs/1104.3905 (2011) - 2010
- [c16]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: 311-322 - [c15]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? IPEC 2010: 135-146 - [i2]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? CoRR abs/1004.1485 (2010)
2000 – 2009
- 2009
- [b1]Joachim Kneis:
Intuitive algorithms. RWTH Aachen University, 2009, pp. 1-167 - [j5]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discret. Math. 23(1): 407-427 (2009) - [j4]Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke:
Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009) - [c14]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS 2009: 287-298 - [c13]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: 161-172 - [c12]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [i1]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 abs/0909.4224 (2009) - 2008
- [c11]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281 - [c10]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251 - [c9]Joachim Kneis, Alexander Langer:
A Practical Approach to Courcelle's Theorem. MEMICS 2008: 65-81 - 2007
- [j3]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 Oper. Res. 2(2): 83-93 (2007) - [j2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007) - [c8]Joachim Kneis, Daniel Mölle, Peter Rossmanith:
Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376 - 2006
- [j1]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006) - [c7]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: 251-270 - [c6]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607 - [c5]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195 - [c4]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Divide-and-Color. WG 2006: 58-67 - 2005
- [c3]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579 - [c2]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396 - 2003
- [c1]Jens Gerlach, Joachim Kneis:
Generic Programming for Scientific Computing in C++, Java, and C#. APPT 2003: 301-310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
