Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Bart M. P.
    Last name: Jansen
    DBLP: 58/8776
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 67 of 67  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Bart M. P. Jansen.
    Turing kernelization for finding long paths and cycles in restricted graph classes.
    J. Comput. Syst. Sci. 2017, Volume 85 (0) 2017
    Conference paper
    Bart M. P. Jansen, Marcin Pilipczuk.
    Approximation and Kernelization for Chordal Vertex Deletion.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Lars Jaffke, Bart M. P. Jansen.
    Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Bart M. P. Jansen.
    On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.
    J. Graph Algorithms Appl. 2017, Volume 21 (0) 2017
    Conference paper
    Lars Jaffke, Bart M. P. Jansen.
    Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.
    Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings 2017 (0) 2017
    Journal article
    Bart M. P. Jansen, Astrid Pieterse.
    Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.
    Algorithmica 2017, Volume 79 (0) 2017
    Conference paper
    Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna.
    Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh.
    Uniform Kernelization Complexity of Hitting Forbidden Minors.
    ACM Trans. Algorithms 2016, Volume 13 (0) 2017
    Conference paper
    Bart M. P. Jansen.
    Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.
    33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France 2016 (0) 2016
    Journal article
    Bart M. P. Jansen, Marcin Pilipczuk.
    Approximation and Kernelization for Chordal Vertex Deletion.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Bart M. P. Jansen, Astrid Pieterse.
    Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger.
    Fine-Grained Complexity Analysis of Two Classic TSP Variants.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger.
    Fine-Grained Complexity Analysis of Two Classic TSP Variants.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Bart M. P. Jansen, Astrid Pieterse.
    Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Bart M. P. Jansen, Jules Wulms.
    Lower Bounds for Protrusion Replacement by Counting Equivalence Classes.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee.
    Independent Set Reconfiguration Thresholds of Hereditary Graph Classes.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee.
    Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes.
    36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India 2016 (0) 2016
    Conference paper
    Bart M. P. Jansen, Jules Wulms.
    Lower Bounds for Protrusion Replacement by Counting Equivalence Classes.
    11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark 2017 (0) 2016
    Conference paper
    Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond.
    The First Parameterized Algorithms and Computational Experiments Challenge.
    11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark 2017 (0) 2016
    Conference paper
    Bart M. P. Jansen, Dániel Marx.
    Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Bart M. P. Jansen.
    On Sparsification for Computing Treewidth.
    Algorithmica 2015, Volume 71 (0) 2015
    Journal article
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh.
    Uniform Kernelization Complexity of Hitting Forbidden Minors.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh.
    Uniform Kernelization Complexity of Hitting Forbidden Minors.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Journal article
    Bart M. P. Jansen, Stefan Kratsch.
    A structural approach to kernels for ILPs: Treewidth and Total Unimodularity.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Bart M. P. Jansen.
    On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Bart M. P. Jansen, Stefan Kratsch.
    A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity.
    Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings 2015 (0) 2015
    Journal article
    Bart M. P. Jansen, Astrid Pieterse.
    Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Bart M. P. Jansen, Astrid Pieterse.
    Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT.
    10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece 2015 (0) 2015
    Conference paper
    Bart M. P. Jansen.
    On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.
    Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers 2016 (0) 2015
    Conference paper
    Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh.
    A Near-Optimal Planarization Algorithm.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk.
    Preprocessing subgraph and minor problems: When does a small vertex cover help?
    J. Comput. Syst. Sci. 2014, Volume 80 (0) 2014
    Journal article
    Bart M. P. Jansen.
    Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernelization Lower Bounds by Cross-Composition.
    SIAM J. Discrete Math. 2014, Volume 28 (0) 2014
    Conference paper
    Bart M. P. Jansen.
    Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Bart M. P. Jansen, Dániel Marx.
    Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen.
    FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
    TOCT 2014, Volume 6 (0) 2014
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond.
    Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
    Eur. J. Comb. 2013, Volume 34 (0) 2013
    Journal article
    Michael R. Fellows, Bart M. P. Jansen.
    FPT is Characterized by Useful Obstruction Sets
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Bart M. P. Jansen, Hans L. Bodlaender.
    Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter.
    Theory Comput. Syst. 2013, Volume 53 (0) 2013
    Conference paper
    Bart M. P. Jansen.
    On Sparsification for Computing Treewidth.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen.
    FPT Is Characterized by Useful Obstruction Sets.
    Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers 2013 (0) 2013
    Conference paper
    Bart M. P. Jansen.
    On Sparsification for Computing Treewidth.
    Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers 2013 (0) 2013
    Journal article
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernel bounds for path and cycle problems.
    Theor. Comput. Sci. 2013, Volume 511 (0) 2013
    Journal article
    Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger.
    Parameterized complexity of vertex deletion into perfect graph classes.
    Theor. Comput. Sci. 2013, Volume 511 (0) 2013
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.
    SIAM J. Discrete Math. 2013, Volume 27 (0) 2013
    Journal article
    Bart M. P. Jansen, Stefan Kratsch.
    Data reduction for graph coloring problems.
    Inf. Comput. 2013, Volume 231 (0) 2013
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernel Bounds for Structural Parameterizations of Pathwidth.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk.
    Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
    Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernelization Lower Bounds By Cross-Composition
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk.
    Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernel Bounds for Structural Parameterizations of Pathwidth
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Bart M. P. Jansen.
    Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights.
    J. Graph Algorithms Appl. 2012, Volume 16 (0) 2012
    Conference paper
    Bart M. P. Jansen, Hans L. Bodlaender.
    Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2011
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Cross-Composition: A New Technique for Kernelization Lower Bounds.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2011
    Journal article
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Bart M. P. Jansen, Stefan Kratsch.
    Data Reduction for Graph Coloring Problems
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.
    Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 (0) 2011
    Journal article
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernel Bounds for Path and Cycle Problems
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Bart M. P. Jansen, Stefan Kratsch.
    On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Bart M. P. Jansen, Stefan Kratsch.
    Data Reduction for Graph Coloring Problems.
    Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger.
    Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.
    Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann.
    Connect the dot: Computing feed-links for network extension.
    J. Spatial Information Science 2011, Volume 3 (0) 2011
    Conference paper
    Bart M. P. Jansen, Stefan Kratsch.
    On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal.
    Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers 2012 (0) 2011
    Conference paper
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Kernel Bounds for Path and Cycle Problems.
    Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers 2012 (0) 2011
    Journal article
    Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch.
    Cross-Composition: A New Technique for Kernelization Lower Bounds
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Bart M. P. Jansen, Hans L. Bodlaender.
    Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh.
    Determining the Winner of a Dodgson Election is Hard.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India 2010 (0) 2010
    Show item 1 to 67 of 67  

    Your query returned 67 matches in the database.