arXiv 2017-11-14 EN A note on the complexity of Feedback Vertex Set parameterized by mim-width Jaffke, Lars · Kwon, O-joung · Telle, Jan Arne
arXiv 2017-10-19 EN A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width Jaffke, Lars · Kwon, O-joung · Telle, Jan Arne
arXiv 2017-10-12 EN Modular decomposition of transitive graphs and transitively orienting their complements Koehler, Henning
arXiv 2017-08-15 EN Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width Jaffke, Lars · Kwon, O-joung · Telle, Jan Arne
arXiv 2017-03-28 EN A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm Kaibel, Volker · Walter, Matthias
arXiv 2017-01-04 EN An anti-incursion algorithm for unknown probabilistic adversaries on connected graphs Geneson, Jesse
arXiv 2016-11-21 EN FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams Jung, Minsoo · Lee, Sunmin · Lim, Yongsub · Kang, U
arXiv 2016-10-19 EN Explicit linear kernels for packing problems Garnero, Valentin · Paul, Christophe · Sau, Ignasi · Thilikos, Dimitrios M.
arXiv 2016-10-09 EN Distributed pursuit algorithms for probabilistic adversaries on connected graphs Geneson, Jesse
arXiv 2016-09-25 EN Linear kernels for edge deletion problems to immersion-closed graph classes Giannopoulou, Archontia C. · Pilipczuk, Michał · Thilikos, Dimitrios M. · Raymond, Jean-Florent +1
arXiv 2016-06-10 EN Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics Komusiewicz, Christian · Nichterlein, André · Niedermeier, Rolf
arXiv 2016-01-07 EN On the Computation of the Optimal Connecting Points in Road Networks Tsatsanifos, George
arXiv 2015-08-19 EN Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions Kanté, Mamadou Moustapha · Kwon, O-joung
