|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 13 keywords
|
|
|
|
|
Results
Found 107 publication records. Showing 107 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh |
Computing Optimal Steiner Trees in Polynomial Space.  |
Algorithmica  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx |
Clustering with local restrictions. |
Inf. Comput. |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pål G. Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
A O(c^k n) 5-Approximation Algorithm for Treewidth |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh |
Sharp Separation and Applications to Exact and Parameterized Algorithms. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Kernel(s) for problems with no kernel: On out-trees with many leaves. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Faster Parameterized Algorithms using Linear Programming |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Planar F-Deletion: Approximation and Optimal FPT Algorithms |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý |
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
SIAM J. Discrete Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Cops and Robber Game Without Recharging. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao |
Faster algorithms for finding and counting subgraphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger |
Local search: Is brute-force avoidable? |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on H-minor-free graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
Bidimensionality and geometric graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, M. S. Ramanujan |
Parameterized Tractability of Multiway Cut with Parity Constraints. |
ICALP |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Kernelization - Preprocessing with a Guarantee. |
The Multivariate Algorithmic Revolution and Beyond |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. |
FOCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström |
On Problems as Hard as CNF-SAT. |
IEEE Conference on Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the directed Full Degree Spanning Tree problem. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
Treewidth governs the complexity of target set selection. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential algorithms for partial cover problems. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
A linear kernel for a planar connected dominating set. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Guard games on graphs: Keep the intruder out! |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An exact algorithm for minimum distortion embedding. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
On the complexity of some colorful problems parameterized by treewidth. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christina Boucher, Christine Lo, Daniel Lokshtanov |
Outlier Detection for DNA Fragment Assembly |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
Bidimensionality and Geometric Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström |
On Problems as Hard as CNFSAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Lower bounds based on the Exponential Time Hypothesis. |
Bulletin of the EATCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs and Threshold Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
On the complexity of reconstructing H-free graphs from their Star Systems. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Planar k-Path in Subexponential Time and Polynomial Space. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Slightly Superexponential Parameterized Problems. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx |
Clustering with Local Restrictions. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Tight Bounds for Linkages in Planar Graphs. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On the Hardness of Losing Width. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On Cutwidth Parameterized by Vertex Cover. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
Kernelization: An Overview. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Daniel Lokshtanov |
Feedback Vertex Set in Mixed Graphs. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Paul S. Bonsma, Daniel Lokshtanov |
Feedback Vertex Set in Mixed Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
On the complexity of computing treelength. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos |
Characterizing and computing minimal cograph completions. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Intractability of Clique-Width Parameterizations. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Bidimensionality and Kernels. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
Algorithmic Lower Bounds for Problems on Decomposable Graphs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
Sharp Separation and Applications to Exact and Parameterized Algorithms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Cops and Robber Game without Recharging. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Imbalance Is Fixed Parameter Tractable. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
Ranking and Drawing in Subexponential Time. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh |
Determining the Winner of a Dodgson Election is Hard. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Jesper Nederlof |
Saving space by algebraization. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
moebius, dynamic programming, space efficient, fourier |
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh |
Faster Algorithms for Finding and Counting Subgraphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity |
| 1 | Daniel Lokshtanov |
Finding the longest isometric cycle in a graph. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An Exact Algorithm for Minimum Distortion Embedding. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Clique-width: on the price of generality. |
SODA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Local Search: Is Brute-Force Avoidable? |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Dom, Daniel Lokshtanov, Saket Saurabh |
Incompressibility through Colors and IDs. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
Distortion Is Fixed Parameter Tractable. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel Lokshtanov, Saket Saurabh |
Fast FAST. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Linear Kernel for Planar Connected Dominating Set. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx |
Planar Capacitated Dominating Set Is W[1]-Hard. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh |
Even Faster Algorithm for Set Splitting! |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Guard Games on Graphs: Keep the Intruder Out! |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
An exact almost optimal algorithm for target set selection in social networks. |
ACM Conference on Electronic Commerce |
2009 |
DBLP DOI BibTeX RDF |
bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing |
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynonial Time Preprocessing, Counting Monadic Second Order Logic, Finite Integer Index, Graphs of Bounded Genus, Planar Graphs, Kernelization, Parameterized Algorithms, Finite State |
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-Free Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
Simpler Parameterized Algorithm for OCT. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential Algorithms for Partial Cover Problems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos |
Characterizing and Computing Minimal Cograph Completions. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
On the Complexity of Reconstructing H -free Graphs from Their Star Systems. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Capacitated Domination and Covering: A Parameterized Perspective. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 107 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")