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 10 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 0001.
    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
    Show item 1 to 10 of 67  

    Your query returned 67 matches in the database.