Bart M.P. Jansen

Research output

Research output per year 2008 2021

• 552 Citations
• 40 Article
• 25 Conference contribution
• 4 Report
• 3 Paper
• 2 More
  • 1 Chapter
  • 1 Foreword/postscript

Research output per year

Research output per year

Search results

• Report

  A structural approach to kernels for ILPs : treewidth and total unimodularity

  Jansen, B. M. P. & Kratsch, S., 2015, s.n. 24 p. (arXiv; vol. 1506.07729 [cs.CC])

  Research output: Book/Report › Report › Academic

  Open Access

  File

  • Inductive logic programming (ILP)
  • Computational complexity
  • Testing
  16 Citations (Scopus)

  90 Downloads (Pure)

• On structural parameterizations of hitting set : hitting paths in graphs using 2-SAT

  Jansen, B. M. P., 2015, s.n. 25 p. (arXiv; vol. 1507.05890 [cs.DS])

  Research output: Book/Report › Report › Academic

  Open Access

  File

  • Hitting Set
  • Parameterization
  • Path
  • Graph in graph theory
  • Vertex of a graph
  80 Downloads (Pure)

• Sparsification upper and lower bounds for graph problems and Not-All-Equal SAT

  Jansen, B. M. P. & Pieterse, A., 2015, s.n. 21 p. (arXiv; vol. 1509.07437 [cs.CC])

  Research output: Book/Report › Report › Academic

  • Hamiltonians
  • Coloring
  • Polynomials
  • Graph theory
  • Set theory
  4 Citations (Scopus)

  1 Downloads (Pure)

• Uniform kernelization complexity of hitting forbidden minors

  Giannopoulou, A. C., Jansen, B. M. P., Lokshtanov, D. & Saurabh, S., 2015, s.n. 35 p. (arXiv; vol. 1502.03965 [cs.DS])

  Research output: Book/Report › Report › Academic

  • Forbidden Minor
  • Kernelization
  • Deletion
  • kernel
  • Minor
  7 Citations (Scopus)