The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Stefan Kratsch" ( http://dblp.L3S.de/Authors/Stefan_Kratsch )

URL (Homepage):  http://www.mpi-inf.mpg.de/~skratsch/  Author page on DBLP  Author page in RDF  Community of Stefan Kratsch in ASPL-2

Publication years (Num. hits)
2009-2011 (31) 2012 (16) 2013 (20) 2014 (20) 2015 (16) 2016 (16) 2017-2018 (24) 2019 (10)
Publication types (Num. hits)
article(88) incollection(2) inproceedings(62) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 154 publication records. Showing 153 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset Problem. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The parameterized complexity of the minimum shared edges problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch On Kernelization for Edge Dominating Set under Structural Parameters. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Falko Hegerfeld, Stefan Kratsch On adaptive algorithms for maximum matching. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the computational complexity of multilayer subgraph detection. Search on Bibsonomy Network Science The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Falko Hegerfeld, Stefan Kratsch On Adaptive Algorithms for Maximum Matching. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch On Kernelization for Edge Dominating Set under Structural Parameters. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jérémy Barbay, Johannes Fischer 0001, Stefan Kratsch, Srinivasa Rao Satti Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch Parameterized complexity of team formation in social networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Stefan Kratsch, Jesper Nederlof Fast Hamiltonicity Checking Via Bases of Perfect Matchings. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch A Randomized Polynomial Kernel for Subset Feedback Vertex Set. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Burton, Sergio Cabello, Stefan Kratsch, William Pettersson The parameterized complexity of finding a 2-sphere in a simplicial complex. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Stefan Kratsch, Florian Nelles Efficient and adaptive parameterized algorithms on modular decompositions. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin M. Varma Bipartite Graphs of Small Readability. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström Multi-budgeted directed cuts. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Stefan Kratsch, Florian Nelles Efficient and Adaptive Parameterized Algorithms on Modular Decompositions. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin M. Varma Bipartite Graphs of Small Readability. Search on Bibsonomy COCOON The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström Multi-Budgeted Directed Cuts. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial kernels for weighted problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch Smaller parameters for vertex cover kernelization. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Yann Disser, Stefan Kratsch Robust and adaptive search. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok Characterizing width two for variants of treewidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Martin Milanic On the complexity of the identifiable subgraph problem, revisited. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Pascal Schweitzer Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Toni Böhnlein, Stefan Kratsch, Oliver Schaudt Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-layer Subgraph Detection. Search on Bibsonomy CIAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yann Disser, Stefan Kratsch Robust and Adaptive Search. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch Smaller Parameters for Vertex Cover Kernelization. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Kernelization, Polynomial Lower Bounds. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Kernelization, Preprocessing for Treewidth. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Geevarghese Philip, Saurabh Ray Point Line Cover: The Easy Kernel is Essentially Tight. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Finding Shortest Paths Between Graph Colourings. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch On polynomial kernels for sparse integer linear programs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch A randomized polynomial kernelization for Vertex Cover with a smaller parameter. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-Layer Subgraph Detection. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Stefan Kratsch, Martin Milanic On the complexity of the identifiable subgraph problem, revisited. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Stefan Kratsch, Dániel Marx, Magnus Wahlström Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. Search on Bibsonomy TOCT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen Preprocessing Under Uncertainty: Matroid Intersection. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch A Randomized Polynomial Kernel for Subset Feedback Vertex Set. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen Preprocessing Under Uncertainty. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch Parameterized Complexity of Team Formation in Social Networks. Search on Bibsonomy AAIM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger Approximability and parameterized complexity of multicover by c-intervals. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger How to Put Through Your Agenda in Collective Binary Decisions. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu 0001 A Completeness Theory for Polynomial (Turing) Kernelization. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial Kernels for Weighted Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch A randomized polynomial kernel for Subset Feedback Vertex Set. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen Preprocessing under uncertainty. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch A structural approach to kernels for ILPs: Treewidth and Total Unimodularity. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch A shortcut to (sun)flowers: Kernels in logarithmic space or linear time. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Search on Bibsonomy Inf. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem. Search on Bibsonomy SEA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial Kernels for Weighted Problems. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy FSTTCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Co-Nondeterminism in Compositions: A Kernelization Lower Bound for a Ramsey-Type Problem. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Kernelization Lower Bounds by Cross-Composition. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch Streaming Kernelization. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Colouring Reconfiguration Is Fixed-Parameter Tractable. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Stefan Kratsch Recent developments in kernelization: A survey. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2014 DBLP  BibTeX  RDF
1Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai 0001, Venkatesh Raman 0001 Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. Search on Bibsonomy TOCT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Clique Cover and Graph Separation: New Incompressibility Results. Search on Bibsonomy TOCT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Geevarghese Philip, Saurabh Ray Point Line Cover: The Easy Kernel is Essentially Tight. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Fafianie, Stefan Kratsch Streaming Kernelization. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset Problem. Search on Bibsonomy WAOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Vuong Anh Quyen On Kernels for Covering and Packing ILPs with Small Coefficients. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Finding Shortest Paths Between Graph Colourings. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Frank Neumann 0001 Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström Parameterized Two-Player Nash Equilibrium. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch Kernel bounds for path and cycle problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger Parameterized complexity of vertex deletion into perfect graph classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter Bin packing with fixed number of bins revisited. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch On Polynomial Kernels for Sparse Integer Linear Programs Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Stefan Kratsch, Geevarghese Philip, Saurabh Ray Point Line Cover: The Easy Kernel is Essentially Tight. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Stefan Kratsch On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Stefan Kratsch, Magnus Wahlström Two edge modification problems without polynomial kernels. Search on Bibsonomy Discrete Optimization The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Stefan Kratsch Data reduction for graph coloring problems. Search on Bibsonomy Inf. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility. Search on Bibsonomy ESA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. Search on Bibsonomy WG The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 153 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license