Bart M. P. Jansen

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Bart M. P. Jansen authored at least 63 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies.
J. Comput. Syst. Sci., 2022

Search-Space Reduction via Essential Vertices.
CoRR, 2022

Finding k-Secluded Trees Faster.
CoRR, 2022

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest.
CoRR, 2022

Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Fine-grained Complexity Analysis of Two Classic TSP Variants.
ACM Trans. Algorithms, 2021

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.
SIAM J. Discret. Math., 2021

A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion.
J. Comput. Syst. Sci., 2021

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation.
Algorithmica, 2021

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Vertex deletion parameterized by elimination distance and even less.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

On the Hardness of Compressing Weights.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Polynomial kernels for hitting forbidden minors under structural parameterizations.
Theor. Comput. Sci., 2020

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth.
J. Graph Algorithms Appl., 2020

Lower bounds for protrusion replacement by counting equivalence classes.
Discret. Appl. Math., 2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms.
CoRR, 2020

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.
Algorithmica, 2020

Sparsification Lower Bounds for List H-Coloring.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Optimal Polynomial-Time Compression for Boolean Max CSP.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.
ACM Trans. Comput. Theory, 2019

Computing the chromatic number using graph decompositions via matrix rank.
Theor. Comput. Sci., 2019

Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144).
NII Shonan Meet. Rep., 2019

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
Algorithmica, 2019

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
Algorithmica, 2019

Hamiltonicity Below Dirac's Condition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Approximation and Kernelization for Chordal Vertex Deletion.
SIAM J. Discret. Math., 2018

Independent-set reconfiguration thresholds of hereditary graph classes.
Discret. Appl. Math., 2018

2017
Uniform Kernelization Complexity of Hitting Forbidden Minors.
ACM Trans. Algorithms, 2017

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.
J. Graph Algorithms Appl., 2017

Turing kernelization for finding long paths and cycles in restricted graph classes.
J. Comput. Syst. Sci., 2017

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.
Algorithmica, 2017

Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
On Sparsification for Computing Treewidth.
Algorithmica, 2015

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, 2015

Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity.
Proceedings of the Algorithms - ESA 2015, 2015

2014
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
ACM Trans. Comput. Theory, 2014

Kernelization Lower Bounds by Cross-Composition.
SIAM J. Discret. Math., 2014

Preprocessing subgraph and minor problems: When does a small vertex cover help?
J. Comput. Syst. Sci., 2014

A Near-Optimal Planarization Algorithm.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Parameterized complexity of vertex deletion into perfect graph classes.
Theor. Comput. Sci., 2013

Kernel bounds for path and cycle problems.
Theor. Comput. Sci., 2013

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.
SIAM J. Discret. Math., 2013

Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter.
Theory Comput. Syst., 2013

Data reduction for graph coloring problems.
Inf. Comput., 2013

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
Eur. J. Comb., 2013

FPT Is Characterized by Useful Obstruction Sets.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights.
J. Graph Algorithms Appl., 2012

Kernel Bounds for Structural Parameterizations of Pathwidth.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011
Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Cross-Composition: A New Technique for Kernelization Lower Bounds.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010
Polynomial Kernels for Hard Problems on Disk Graphs.
Proceedings of the Algorithm Theory, 2010

Determining the Winner of a Dodgson Election is Hard.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008
Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008


  Loading...