pith. sign in

Bart M. P. Jansen

Identifiers

  • name variant Bart M. P. Jansen 0.60 · backfill

Papers (24)

  1. Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances cs.DM · 2026 · author #3
  2. Best-case and Worst-case Sparsifiability of Boolean CSPs cs.CC · 2018 · author #2
  3. Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations cs.CC · 2018 · author #1
  4. Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials cs.CC · 2018 · author #1
  5. Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor cs.DS · 2017 · author #1
  6. Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems cs.DS · 2017 · author #2
  7. Fine-Grained Complexity Analysis of Two Classic TSP Variants cs.DS · 2016 · author #3
  8. Approximation and Kernelization for Chordal Vertex Deletion cs.DS · 2016 · author #1
  9. On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT cs.DS · 2015 · author #1
  10. A structural approach to kernels for ILPs: Treewidth and Total Unimodularity cs.CC · 2015 · author #1
  11. Uniform Kernelization Complexity of Hitting Forbidden Minors cs.DS · 2015 · author #2
  12. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels cs.DS · 2014 · author #1
  13. Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes cs.DS · 2014 · author #1
  14. On Sparsification for Computing Treewidth cs.CC · 2013 · author #1
  15. FPT is Characterized by Useful Obstruction Sets cs.CC · 2013 · author #2
  16. Kernel Bounds for Structural Parameterizations of Pathwidth cs.DS · 2012 · author #2
  17. Kernelization Lower Bounds By Cross-Composition cs.CC · 2012 · author #2
  18. Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? cs.DS · 2012 · author #2
  19. On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal cs.DS · 2011 · author #1
  20. Kernel Bounds for Path and Cycle Problems cs.DS · 2011 · author #2
  21. Data Reduction for Graph Coloring Problems cs.DS · 2011 · author #1
  22. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization cs.DS · 2011 · author #2
  23. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter cs.DS · 2010 · author #1
  24. Cross-Composition: A New Technique for Kernelization Lower Bounds cs.CC · 2010 · author #2

Mentions

  • 1207.4900 #2 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1206.5941 #2 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1206.4912 #2 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1107.3658 #1 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1106.4141 #2 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1104.4229 #1 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1104.4217 #2 · backfill · confidence 0.70 Bart M. P. Jansen
  • 2605.19055 #3 · arxiv_oai · confidence 0.70 Bart M. P. Jansen
  • 1012.4701 #1 · backfill · confidence 0.70 Bart M. P. Jansen
  • 1011.4224 #2 · backfill · confidence 0.70 Bart M. P. Jansen

Frequent Coauthors