Vitenskapelig artikkel

• Agrawal, Akanksha; Knudsen, Kristine Vitting Klinkby; Lokshtanov, Daniel et al. (2023). The Parameterized Complexity of Guarding Almost Convex Polygons. (ekstern lenke)
• Jaffke, Lars; Lima, Paloma T.; Lokshtanov, Daniel (2023). b-Coloring Parameterized by Clique-Width. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu et al. (2022). Erdős–Pósa property of obstructions to interval graphs. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel et al. (2022). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (ekstern lenke)
• Blair, Jean; Heggernes, Pinar; Lima, Paloma T. et al. (2022). On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. (ekstern lenke)
• Crespelle, Christophe; Lokshtanov, Daniel; Phan, Thi Ha Duong et al. (2021). Faster and enhanced inclusion-minimal cograph completion. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2021). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs . (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M.S. et al. (2021). FPT-approximation for FPT Problems. (ekstern lenke)
• Gunda, Spoorthy; Jain, Pallavi; Lokshtanov, Daniel et al. (2021). On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. (ekstern lenke)
• Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav (2021). Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). (ekstern lenke)
• Kumar, Neeraj; Lokshtanov, Daniel; Saurabh, Saket et al. (2021). A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. (ekstern lenke)
• Jaffke, Lars; Lima, Paloma Thome de; Lokshtanov, Daniel (2021). b-Coloring Parameterized by Clique-Width. (ekstern lenke)
• Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Lokshtanov, Daniel et al. (2021). Diversity in Kemeny Rank Aggregation: A Parameterized Approach. (ekstern lenke)
• Drange, Pål Grønås; Dregi, Markus Fanebust; Lokshtanov, Daniel et al. (2021). On the threshold of intractability. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Mihajlin, Ivan et al. (2021). Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep et al. (2021). 2-Approximating Feedback Vertex Set in Tournaments. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu et al. (2020). Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems. (ekstern lenke)
• Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel et al. (2020). Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. (ekstern lenke)
• Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel et al. (2020). Path contraction faster than $2^n$. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2020). Bidimensionality and Kernels. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep et al. (2020). 2-Approximating Feedback Vertex Set in Tournaments. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2020). Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad et al. (2020). A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. (ekstern lenke)
• Agrawal, Akanksha; Knudsen, Kristine Vitting Klinkby; Lokshtanov, Daniel et al. (2020). The Parameterized Complexity of Guarding Almost Convex Polygons. (ekstern lenke)
• Lokshtanov, Daniel; Ramanujan, M.S.; Saurabh, Saket et al. (2020). Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. (ekstern lenke)
• Blair, Jean R S; Heggernes, Pinar; Lima, Paloma T. et al. (2020). On the maximum number of edges in chordal graphs of bounded degree and matching number. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2020). Hitting Topological Minors Is FPT. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2020). ETH-tight algorithms for long path and cycle on unit disk graphs. (ekstern lenke)
• Lochet, William; Lokshtanov, Daniel; Misra, Pranabendu et al. (2020). Fault tolerant subgraphs with applications in kernelization. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2020). Parameterization Above a Multiplicative Guarantee . (ekstern lenke)
• Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel et al. (2019). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2019). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. (ekstern lenke)
• Lokshtanov, Daniel; Oliveira, Mateus De Oliveira; Saurabh, Saket (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. (ekstern lenke)
• Eppstein, David; Lokshtanov, Daniel (2019). The parameterized complexity of finding point sets with hereditary properties. (ekstern lenke)
• Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket et al. (2019). Packing cycles faster than Erdos-Posa. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Spanning circuits in regular matroids. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Going Far From Degeneracy. (ekstern lenke)
• Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani et al. (2019). Balanced judicious bipartition is fixed-parameter tractable. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket et al. (2019). Split contraction: The untold story. (ekstern lenke)
• Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel et al. (2019). Path Contraction Faster Than 2n. (ekstern lenke)
• Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin et al. (2019). Minimum Bisection Is Fixed-Parameter Tractable. (ekstern lenke)
• Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel et al. (2019). Exact algorithms via monotone local search. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2019). Decomposition of map graphs with applications. (ekstern lenke)
• Lokshtanov, Daniel; Marx, Daniel; Saurabh, Saket (2018). Known algorithms on graphs of bounded treewidth are probably optimal. (ekstern lenke)
• Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani et al. (2018). Balanced judicious bipartition is fixed-paramater tractable. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2018). Excluded grid minors and efficient polynomial-time approximation schemes. (ekstern lenke)
• Lokshtanov, Daniel; Pilipczuk, Michal; Saurabh, Saket (2018). Below all subsets for minimal connected dominating set. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad et al. (2018). Quasipolynomial representation of transversal matroids with applications in parameterized complexity. (ekstern lenke)
• Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel et al. (2018). A polynomial sized kernel for tracking paths problem. (ekstern lenke)
• Lokshtanov, Daniel; Ramanujan, M.S.; Saurabh, Saket et al. (2018). Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. (ekstern lenke)
• Carpenter, Timothy; Fomin, Fedor; Lokshtanov, Daniel et al. (2018). Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu et al. (2018). Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2018). Long directed (s,t)-path: FPT algorithm. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Kernels for (Connected) dominating set on graphs with excluded topological minors. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad et al. (2018). Matrix rigidity from the viewpoint of parameterized complexity . (ekstern lenke)
• Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. (ekstern lenke)
• Lokshtanov, Daniel; Marx, Daniel; Saurabh, Saket (2018). Slightly superexponential parameterized problems. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E. et al. (2018). Simultaneous feedback vertex set: A parameterized perspective. (ekstern lenke)
• Lokshtanov, Daniel; Mouawad, Amer E. (2018). The complexity of independent set reconfiguration on bipartite graphs. (ekstern lenke)
• Bacso, Gabor; Lokshtanov, Daniel; Marx, Dániel et al. (2018). Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. (ekstern lenke)
• Lokshtanov, Daniel; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket (2018). Linear time parameterized algorithms for subset feedback vertex set. (ekstern lenke)
• Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad et al. (2018). Reconfiguration on sparse graphs. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu et al. (2018). Erdos-Posa property of obstructions to interval graphs. (ekstern lenke)
• Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen et al. (2018). Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. (ekstern lenke)
• Lokshtanov, Daniel; Ramanujan, MS; Saurabh, Saket et al. (2018). Reducing CMSO model checking to highly connected graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Covering Vectors by Spaces: Regular Matroids. (ekstern lenke)
• Agrawal, Akanksha; Krithika, R; Lokshtanov, Daniel et al. (2018). On the parameterized complexity of simultaneous deletion problems. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu et al. (2018). Polylogarithmic approximation algorithms for weighted-F-Deletion problems. (ekstern lenke)
• Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket (2017). A linear-Time parameterized algorithm for node unique label cover. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket et al. (2017). Split contraction: The untold story. (ekstern lenke)
• Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad et al. (2017). Quick but Odd Growth of Cacti. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad et al. (2017). Matrix rigidity from the viewpoint of parameterized complexity. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S. et al. (2017). Hitting selected (ODD) Cycles. (ekstern lenke)
• Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket et al. (2017). Packing cycles faster than Erdös-Pósa. (ekstern lenke)
• Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S. et al. (2017). Lossy kernelization. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E. (2017). Critical node cut parameterized by treewidth and solution size is W[1]-Hard. (ekstern lenke)
• Giannopoulou, Archontia; Jansen, Bart M.P.; Lokshtanov, Daniel et al. (2017). Uniform kernelization complexity of hitting forbidden minors. (ekstern lenke)
• Jones, Mark; Lokshtanov, Daniel; Maadapuzhi Shridharan, Ramanujan et al. (2017). Parameterized complexity of directed Steiner tree on sparse graphs. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2017). Representative families of product families. (ekstern lenke)
• Adler, Isolde Marianne; Kolliopoulos, Stavros G.; Krause, Philipp Klaus et al. (2017). Irrelevant vertices for the planar Disjoint Paths Problem. (ekstern lenke)
• Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel et al. (2017). Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. (ekstern lenke)
• Kumar, Mithilesh; Lokshtanov, Daniel (2017). A 2lk kernel for l-component order connectivity. (ekstern lenke)
• Lokshtanov, Daniel; Pilipczuk, Marcin; van Leeuwen, Erik Jan (2017). Independence and efficient domination on P6-free graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Spanning Circuits in Regular Matroids. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Covering vectors by spaces: Regular matroids. (ekstern lenke)
• Chitnis, Rajesh; Fomin, Fedor; Lokshtanov, Daniel et al. (2017). Faster exact algorithms for some terminal set problems. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. (ekstern lenke)
• Hassan, Olawale; Kanj, Iyad; Lokshtanov, Daniel et al. (2016). On the ordered list subgraph embedding problems. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo et al. (2016). Kernelization of cycle packing with relaxed disjointness constraints. (ekstern lenke)
• Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin et al. (2016). Lower bounds for approximation schemes for closest string. (ekstern lenke)
• Cygan, Marek; Dell, Holger; Lokshtanov, Daniel et al. (2016). On problems as hard as CNF-SAT. (ekstern lenke)
• Agrawal, Akanksha; Lokshtanov, Daniel; Abdo Mouawad, Amer et al. (2016). SIMULTANEOUS Feedback Vertex set: A parameterized perspective. (ekstern lenke)
• Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel et al. (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. (ekstern lenke)
• Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel et al. (2016). Exact algorithms via monotone local search. (ekstern lenke)
• Giannopoulou, Archontia; Lokshtanov, Daniel; Saurabh, Saket et al. (2016). Tree deletion set has a polynomial kernel (but No OPTο(1) Approximation). (ekstern lenke)
• Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan et al. (2016). A new perspective on FO model checking of dense graph classes. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel et al. (2016). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (ekstern lenke)
• Bodlaender, Hans L.; Fomin, Fedor; Lokshtanov, Daniel et al. (2016). (Meta) Kernelization. (ekstern lenke)
• Kumar, Mithilesh; Lokshtanov, Daniel (2016). Faster exact and parameterized algorithm for feedback vertex set in tournaments. (ekstern lenke)
• Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland et al. (2016). A $c^k n$ 5-approximation algorithm for treewidth. (ekstern lenke)
• Agrawal, Akanksha; Kolay, Sudeshna; Lokshtanov, Daniel et al. (2016). A faster FPT algorithm and a smaller kernel for block graph vertex deletion. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2016). Hitting forbidden minors: Approximation and kernelization. (ekstern lenke)
• Drange, Pål Grønås; Dregi, Markus Sortland; Fomin, Fedor et al. (2016). Kernelization and sparseness: The case of dominating set. (ekstern lenke)
• Boucher, Christina; Lo, Christine; Lokshtanov, Daniel (2015). Consensus patterns (Probably) has no EPTAS. (ekstern lenke)
• Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad et al. (2015). Quick but odd growth of cacti. (ekstern lenke)
• Giannopoulou, Archontia; Jansen, Bart Maarten Paul; Lokshtanov, Daniel et al. (2015). Uniform kernelization complexity of hitting forbidden minors. (ekstern lenke)
• Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad et al. (2015). Reconfiguration on sparse graphs. (ekstern lenke)
• Drange, Pål Grønås; Dregi, Markus Sortland; Lokshtanov, Daniel et al. (2015). On the threshold of intractability. (ekstern lenke)
• Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel et al. (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad et al. (2015). Deterministic truncation of linear matroids. (ekstern lenke)
• Gabizon, Ariel; Lokshtanov, Daniel; Pilipczuk, Michal Pawel (2015). Fast algorithms for parameterized problems with relaxed disjointness constraints. (ekstern lenke)
• Lokshtanov, Daniel; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket (2015). Linear time parameterized algorithms for subset feedback vertex set. (ekstern lenke)
• Heggernes, Pinar; van 't Hof, Pim; Lévêque, Benjamin et al. (2014). Contracting graphs to paths and trees. (ekstern lenke)
• Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin et al. (2014). On cutwidth parameterized by vertex cover. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2014). Almost optimal lower bounds for problems parameterized by clique-width. (ekstern lenke)
• Lokshtanov, Daniel; Narayanaswamy, N.S.; Raman, Venkatesh et al. (2014). Faster parameterized algorithms using linear programming. (ekstern lenke)
• Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket (2014). Kernelization lower bounds through colors and IDs. (ekstern lenke)
• Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel et al. (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. (ekstern lenke)
• Lokshtanov, Daniel; Saurabh, Saket; Suchy, Ondrej (2014). Solving Multicut faster than 2n. (ekstern lenke)
• Giannopoulou, Archontia; Lokshtanov, Daniel; Saurabh, Saket et al. (2014). Tree deletion set has a polynomial kernel (but no OPTO(1) approximation). (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2014). Representative sets of product families. (ekstern lenke)
• Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel et al. (2013). Obtaining a bipartite graph by contracting few edges. (ekstern lenke)
• Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel et al. (2013). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. (ekstern lenke)
• Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel et al. (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket (2013). Imbalance is fixed parameter tractable. (ekstern lenke)
• Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland et al. (2013). An O(c^k n) 5-approximation algorithm for treewidth. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2013). Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. (ekstern lenke)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter et al. (2013). Computing optimal Steiner trees in polynomial space. (ekstern lenke)
• Lokshtanov, Daniel; Marx, Daniel (2013). Clustering with local restrictions. (ekstern lenke)
• Fomin, Fedor; Grandoni, Fabrizio; Lokshtanov, Daniel et al. (2012). Sharp separation and applications to exact and parameterized algorithms. (ekstern lenke)
• Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel et al. (2012). Computing the cutwidth of bipartite permutation graphs in linear time. (ekstern lenke)
• Heggernes, Pinar; van 't Hof, Pim; Lévêque, Benjamin et al. (2012). Contracting graphs to paths and trees. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2012). Faster algorithms for finding and counting subgraphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2012). Cops and robber game without recharging. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2012). Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). (ekstern lenke)
• Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor et al. (2012). Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. (ekstern lenke)
• Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin et al. (2012). On Cutwidth Parameterized by Vertex Cover. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2011). Bandwidth on AT-free graphs. (ekstern lenke)
• Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket (2011). A linear kernel for a planar connected dominating set. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2011). An exact algorithm for minimum distortion embedding. (ekstern lenke)
• Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel et al. (2011). Treewidth governs the complexity of target set selection. (ekstern lenke)
• Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket et al. (2011). On the directed Full Degree Spanning Tree problem. (ekstern lenke)
• Fellows, Michael R.; Fomin, Fedor; Lokshtanov, Daniel et al. (2011). On the complexity of some colorful problems parameterized by treewidth. (ekstern lenke)
• Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica et al. (2011). Cutwidth of Split Graphs and Threshold Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2011). Guard games on graphs: Keep the intruder out!. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2011). Subexponential algorithms for partial cover problems. (ekstern lenke)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. (ekstern lenke)
• Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel et al. (2010). Computing the cutwidth of bipartite permutation graphs in linear time. (ekstern lenke)
• Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket (2010). Imbalance is fixed parameter tractable. (ekstern lenke)
• Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel et al. (2010). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. (ekstern lenke)
• Lokshtanov, Daniel (2010). Algorithmic Lower Bounds for Problems on Decomposable Graphs. (ekstern lenke)
• Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper et al. (2010). Generalized graph clustering: recognizing (p,q)-cluster graphs. (ekstern lenke)
• Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel et al. (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. (ekstern lenke)
• Lokshtanov, Daniel; Mancini, Federico; Papadopoulos, Charis (2010). Characterizing and computing minimal cograph completions. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2010). Intractability of clique-width parameterizations. (ekstern lenke)
• Lokshtanov, Daniel (2010). On the complexity of computing treelength. (ekstern lenke)
• Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket et al. (2009). On the Directed Degree-Preserving Spanning Tree Problem. (ekstern lenke)
• Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel et al. (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. (ekstern lenke)
• Alon, Noga; Lokshtanov, Daniel; Saurabh, Saket (2009). Fast FAST. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2009). An Exact Algorithm for Minimum Distortion Embedding. (ekstern lenke)
• Fellows, Michael; Fomin, Fedor; Lokshtanov, Daniel et al. (2009). Distortion Is Fixed Parameter Tractable. (ekstern lenke)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2009). Subexponential Algorithms for Partial Cover Problems. (ekstern lenke)
• Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket (2009). Linear Kernel for Planar Connected Dominating Set. (ekstern lenke)
• Saurabh, Saket; Lokshtanov, Daniel (2009). Even Faster Algorithm for Set Splitting!. (ekstern lenke)
• Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket (2009). Incompressibility through Colors and IDs. (ekstern lenke)
• Lokshtanov, Daniel; Saurabh, Saket; Sikdar, Somnath (2009). Simpler Parameterized Algorithm for OCT. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2009). Bandwidth on AT-Free Graphs. (ekstern lenke)
• Lokshtanov, Daniel (2009). Finding the longest isometric cycle in a graph. (ekstern lenke)
• Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara et al. (2009). The complexity ecology of parameters: An illustration using bounded max leaf number. (ekstern lenke)
• Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket et al. (2008). Capacitated Domination and Covering: A Parameterized Perspective. (ekstern lenke)
• Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica Georgeta et al. (2008). Cutwidth of split graphs, threshold graphs, and proper interval graphs. (ekstern lenke)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2008). On the complexity of reconstructing H-free graphs from their Star Systems. (ekstern lenke)
• Lokshtanov, Daniel; Mancini, Federico; Papadopoulos, Charis (2008). Characterizing and Computing Minimal Cograph Completions. (ekstern lenke)
• Lokshtanov, Daniel (2008). Wheel-free deletion is W[2]-Hard. (ekstern lenke)
• Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara et al. (2008). Graph Layout problems Parameterized by Vertex Cover. (ekstern lenke)
• Lokshtanov, Daniel (2007). On the Complexity of Computing Treelength. (ekstern lenke)
• Heggernes, Pinar; Lokshtanov, Daniel (2006). Optimal broadcast domination in polynomial time. (ekstern lenke)

Lærebok

• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2019). Kernelization. Theory of Parameterized Preprocessing. (ekstern lenke)

Leder

• Lokshtanov, Daniel; Nishimura, Naomi (2018). Preface. (ekstern lenke)

Doktorgradsavhandling

• Kumar, Mithilesh; Lokshtanov, Daniel (2017). Multivariate Algorithmic Analysis of Hitting Small Sets. (ekstern lenke)
• Dregi, Markus Fanebust; Lokshtanov, Daniel (2017). Beyond the question of fixed-parameter tractability. (ekstern lenke)
• Lokshtanov, Daniel (2009). New methods in parameterized algorithms and complexity. (ekstern lenke)

Vitenskapelig monografi

• Cygan, Marek; Fomin, Fedor; Lokshtanov, Daniel et al. (2015). Parameterized Algorithms. (ekstern lenke)

Vitenskapelig Kapittel/Artikkel/Konferanseartikkel

• Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel et al. (2011). Obtaining a bipartite graph by contracting few edges. (ekstern lenke)
• Lokshtanov, Daniel; Nederlof, Jesper (2010). Saving Space by Algebraization. (ekstern lenke)
• Fellows, Michael; Rosamond, Frances; Fomin, Fedor et al. (2009). Local Search: Is Brute-Force Avoidable?. (ekstern lenke)

Se en full oversikt over publikasjoner i Cristin