|
Name: What: Where: E-mail: Phone: Fax: Mail Address: |
Daniel Lokshtanov Research Fellow in Algorithms at UiB HiB, Room 3148, Bergen daniello [4t] ii [d0t] uib [d0t] no +47 55584092 +47 55584199 Institutt for Informatikk, Universitetet i Bergen PB 7803, N-5020 Bergen, Norway |
| I enjoy hiking, skiing, fantasy, sci-fi, tennis, pants, cognac, parmesan and soccer. A couple (now more than a couple) years ago I starred in Fana school theatre. I'm also the coordinator of the Norwegian high school Informatics Olympiad, NIO. Most (all?) of the reasearch I do is in algorithmic graph theory. I recently defended my Phd. which is in parameterized algorithms and complexity. |
|
Fedor Fomin, Petr Golovach, Daniel Lokshtanov and Saket Saurabh: Intractability of Clique-width Parameterizations. SIAM Journal on Computing. To appear. Short version in proceedings of SODA 2009. Daniel Lokshtanov: On the Complexity of Computing Treelength. Discrete Applied Math, To appear. Short version in proceedings of MFCS 2007 Daniel Lokshtanov, Federico Mancini and Charis Papadopoulos Computing and extracting minimal cograph completions in linear time. Discrete Applied Math, To appear. Short version in proceedings of FAW 2008. M.Fellows, D.Lokshtanov, N.Misra, M.Mnich, F.Rosamond and S.Saurabh: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Of Computing Systems. CIE07 special issue. To appear. Daniel Lokshtanov: Finding the longest isometric cycle in a graph. Discrete Applied Math. WLAB05 special issue. To appear. Pinar Heggernes and Daniel Lokshtanov: Optimal broadcast domination of arbitrary graphs in polynomial time. Discrete Mathematics 306-24 (2006), pages 3267-3280. Short version in proceedings of WG 2005. Fedor Fomin, Daniel Lokshtanov, Saket Saurabh and Dimitrios M. Thilikos: Bidimensionality and Kernels To appear in the proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). Fedor Fomin, Petr Golovach, Daniel Lokshtanov and Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized by Clique-width To appear in the proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). Fedor Fomin, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh: Subexponential Algorithms for Partial Cover Problems To appear in the proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009). P.Golovach, P.Heggernes, D.Kratsch, D.Lokshtanov, D.Meister, and S.Saurabh: Bandwidth on AT-free graphs To appear in the proceedings of Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2009). Fedor V. Fomin, Petr Golovach and Daniel Lokshtanov: Guard games on Graphs: Keep the Intruder Out! To appear in the proceedings of Workshop on Approximation and Online Algorithms (WAOA 2009) Daniel Lokshtanov and Saket Saurabh: Even Faster Algorithm for Set Splitting! To appear in the proceedings of International Workshop on Parameterized and Exact Computation (IWPEC 2009) Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh and Somnath Sikdar: On the Directed Degree-Preserving Spanning Tree Problem To appear in the proceedings of International Workshop on Parameterized and Exact Computation (IWPEC 2009) Hans L. Bodlaender, Daniel Lokshtanov and Eelko Penninkx: Planar Capacitated Dominating Set is W[1]-hard. To appear in the proceedings of International Workshop on Parameterized and Exact Computation (IWPEC 2009) H.L.Bodlaender, F.V.Fomin, D.Lokshtanov, E.Penninkx, S.Saurabh and D.M.Thilikos: (Meta) Kernelization. To appear in the proceedings of IEEE Symposium on Foundations of Computer Science (FOCS 2009). Fedor V. Fomin, Daniel Lokshtanov and Saket Saurabh: An Exact Algorithm for Minimum Distortion Embedding To appear in the proceedings of Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009). Daniel Lokshtanov, Saket Saurabh and Somnath Sikdar: Simpler Parameterized Algorithm for OCT To appear in the proceedings of the International Workshop on Combinatorial Algorithms (IWOCA09) Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, and Ilan Newman: An Exact Almost Optimal Algorithm for Target Set Selection in Social Networks. Proceedings of the ACM Conference on Electronic Commerce (EC'09) Noga Alon, Daniel Lokshtanov, and Saket Saurabh: Fast FAST. Proceedings of the International Colloquium on Automata, Languages and Programming, Track A (ICALP09) M.Fellows, F.Fomin, D.Lokshtanov, E.Losievskaja, F.Rosamond and S.Saurabh: Distortion is Fixed Parameter Tractable. Proceedings of the International Colloquium on Automata, Languages and Programming, Track A (ICALP09) Michael Dom, Daniel Lokshtanov, and Saket Saurabh: Incompressibility through Colors and IDs. Proceedings of the International Colloquium on Automata, Languages and Programming, Track A (ICALP09) M. Fellows, F. V. Fomin, D.Lokshtanov, F. A. Rosamond, S. Saurabh and Y. Villanger: Local Search: Is brute-force avoidable? To appear in the proceedings of the Joint Conference on Artificial Intelligence (IJCAI-09) Daniel Lokshtanov, Matthias Mnich and Saket Saurabh: Linear Kernel for Planar Connected Dominating Set. Proceedings of Theory and Applications of Models of Computation (TAMC'09) H.Fernau, F.Fomin, D.Lokshtanov, D.Raible, S.Saurabh and Y.Villanger: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009) M.Fellows, D.Lokshtanov, N.Misra, F. Rosamond and S. Saurabh: Graph Layout problems Parameterized by Vertex Cover. Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2008). Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai and Charis Papadopoulos. Cutwidth of split graphs, threshold graphs, and proper interval graphs. Proceedings of Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008). Michael Dom, Daniel Lokshtanov, Saket Saurabh and Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. Proceedings of International Workshop on Exact and Parameterized Computation (IWPEC 2008) Daniel Lokshtanov: Wheel-free deletion is W[2]-Hard. Proceedings of International Workshop on Exact and Parameterized Computation (IWPEC 2008) F.Fomin, J.Kratochvíl, D.Lokshtanov, F.Mancini and J.A.Telle: On the Complexity of Reconstructing H-free Graphs from their Star Systems. Proceedings of The 8th Latin American Theoretical Informatics Symposium (LATIN 2008) M.Fellows, F.Fomin, D.Lokshtanov, F. Rosamond, S. Saurabh, S. Szeider and C. Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. Proceedings of The First International Conference on Combinatorial Optimization and Applications (COCOA 2007, Invited Paper.) Daniel Lokshtanov and Christian Sloper: Fixed Parameter Set Splitting, Obtaining a Linear Kernel and Improving Running Time. Proceedings of ACID 2005. Daniel Lokshtanov: Phd Thesis, New Methods in Parameterized Algorithms and Complexity. Supervised by Pinar Heggernes. Submitted April 2009, Defended June 2009. Daniel Lokshtanov: Master Thesis, Broadcast Domination. June 2006.
|
