The SCEAS System
| |||||||

## Search the dblp DataBase
Daniel Lokshtanov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Daniel Lokshtanov, Christian Sloper
**Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time.**[Citation Graph (0, 0)][DBLP] ACiD, 2005, pp:105-113 [Conf] - Pinar Heggernes, Daniel Lokshtanov
**Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:187-198 [Conf] - Pinar Heggernes, Daniel Lokshtanov
**Optimal broadcast domination in polynomial time.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:24, pp:3267-3280 [Journal] - Daniel Lokshtanov
**On the Complexity of Computing Treelength.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:276-287 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:366-377 [Conf] **Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.**[Citation Graph (, )][DBLP]**Imbalance Is Fixed Parameter Tractable.**[Citation Graph (, )][DBLP]**(Meta) Kernelization.**[Citation Graph (, )][DBLP]**Subexponential Algorithms for Partial Cover Problems.**[Citation Graph (, )][DBLP]**Incompressibility through Colors and IDs.**[Citation Graph (, )][DBLP]**Distortion Is Fixed Parameter Tractable.**[Citation Graph (, )][DBLP]**Fast FAST.**[Citation Graph (, )][DBLP]**Local Search: Is Brute-Force Avoidable?**[Citation Graph (, )][DBLP]**Bandwidth on AT-Free Graphs.**[Citation Graph (, )][DBLP]**Graph Layout Problems Parameterized by Vertex Cover.**[Citation Graph (, )][DBLP]**Wheel-Free Deletion Is W[2]-Hard.**[Citation Graph (, )][DBLP]**Even Faster Algorithm for Set Splitting!**[Citation Graph (, )][DBLP]**Capacitated Domination and Covering: A Parameterized Perspective.**[Citation Graph (, )][DBLP]**On the Directed Degree-Preserving Spanning Tree Problem.**[Citation Graph (, )][DBLP]**Planar Capacitated Dominating Set Is**[Citation Graph (, )][DBLP]*W*[1]-Hard.**Sharp Separation and Applications to Exact and Parameterized Algorithms.**[Citation Graph (, )][DBLP]**On the Complexity of Reconstructing H -free Graphs from Their Star Systems.**[Citation Graph (, )][DBLP]**Algorithmic Lower Bounds for Problems on Decomposable Graphs.**[Citation Graph (, )][DBLP]**An exact almost optimal algorithm for target set selection in social networks.**[Citation Graph (, )][DBLP]**Clique-width: on the price of generality.**[Citation Graph (, )][DBLP]**Bidimensionality and Kernels.**[Citation Graph (, )][DBLP]**Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.**[Citation Graph (, )][DBLP]**Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.**[Citation Graph (, )][DBLP]**Saving space by algebraization.**[Citation Graph (, )][DBLP]**Cops and Robber Game without Recharging.**[Citation Graph (, )][DBLP]**Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.**[Citation Graph (, )][DBLP]**Linear Kernel for Planar Connected Dominating Set.**[Citation Graph (, )][DBLP]**Guard Games on Graphs: Keep the Intruder Out!**[Citation Graph (, )][DBLP]**An Exact Algorithm for Minimum Distortion Embedding.**[Citation Graph (, )][DBLP]**Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.**[Citation Graph (, )][DBLP]**Characterizing and Computing Minimal Cograph Completions.**[Citation Graph (, )][DBLP]**Simpler Parameterized Algorithm for OCT.**[Citation Graph (, )][DBLP]**Parameterized Low-distortion Embeddings - Graph metrics into lines and trees**[Citation Graph (, )][DBLP]**Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves**[Citation Graph (, )][DBLP]**(Meta) Kernelization**[Citation Graph (, )][DBLP]**Faster Algorithms for Finding and Counting Subgraphs**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs**[Citation Graph (, )][DBLP]**Bidimensionality and EPTAS**[Citation Graph (, )][DBLP]**Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal**[Citation Graph (, )][DBLP]**Finding the longest isometric cycle in a graph.**[Citation Graph (, )][DBLP]**Characterizing and computing minimal cograph completions.**[Citation Graph (, )][DBLP]**On the complexity of computing treelength.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |