Theo dõi
Matthias Mnich
Matthias Mnich
TU Hamburg
Email được xác minh tại tuhh.de - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Scheduling and fixed-parameter tractability
M Mnich, A Wiese
Mathematical Programming 154 (1), 533-562, 2015
1132015
Parameterized complexity of machine scheduling: 15 open problems
M Mnich, R Van Bevern
Computers & Operations Research 100, 254-261, 2018
882018
Combinatorial n-fold integer programming and applications
D Knop, M Koutecký, M Mnich
Mathematical Programming 184 (1-2), 1-34, 2020
822020
The complexity ecology of parameters: An illustration using bounded max leaf number
M Fellows, D Lokshtanov, N Misra, M Mnich, F Rosamond, S Saurabh
Theory of Computing Systems 45 (4), 822-848, 2009
782009
Interval scheduling and colorful independent sets
R Van Bevern, M Mnich, R Niedermeier, M Weller
Journal of Scheduling 18, 449-469, 2015
772015
Voting and bribing in single-exponential time
D Knop, M Koutecký, M Mnich
ACM Transactions on Economics and Computation (TEAC) 8 (3), 1-28, 2020
632020
Polynomial kernels for weighted problems
M Etscheid, S Kratsch, M Mnich, H Röglin
Journal of Computer and System Sciences 84, 1-10, 2017
572017
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
G Gutin, L van Iersel, M Mnich, A Yeo
Journal of Computer and System Sciences, 2011
572011
A linear kernel for planar connected dominating set
D Lokshtanov, M Mnich, S Saurabh
Theoretical Computer Science 412 (23), 2536-2543, 2011
542011
Domination when the stars are out
D Hermelin, M Mnich, EJ Leeuwen, G Woeginger
ACM Transactions on Algorithms (TALG) 15 (2), 1-90, 2019
43*2019
Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks
L Iersel, SM Kelk, M Mnich
arXiv. org e-Print archive, 1-18, 2008
432008
Dynamic parameterized problems and algorithms
J Alman, M Mnich, VV Williams
ACM Transactions on Algorithms (TALG) 16 (4), 1-46, 2020
352020
Max-cut parameterized above the Edwards-Erdős bound
R Crowston, M Jones, M Mnich
Algorithmica 72 (3), 734-757, 2015
332015
Betweenness parameterized above tight lower bound
G Gutin, EJ Kim, M Mnich, A Yeo
Journal of Computer and System Sciences 76 (8), 872-878, 2010
31*2010
Linear kernels and linear-time algorithms for finding large cuts
M Etscheid, M Mnich
Algorithmica 80, 2574-2615, 2018
302018
New algorithms for maximum disjoint paths based on tree-likeness
K Fleszar, M Mnich, J Spoerhase
Mathematical programming 171, 433-461, 2018
292018
A 7/3-approximation for feedback vertex sets in tournaments
M Mnich, VV Williams, LA Végh
arXiv preprint arXiv:1511.01137, 2015
292015
Max-cut parameterized above the Edwards-Erdős bound
R Crowston, M Jones, M Mnich
International Colloquium on Automata, Languages, and Programming, 242-253, 2012
282012
Feedback vertex sets in tournaments
S Gaspers, M Mnich
Journal of Graph Theory 72 (1), 72-89, 2013
272013
Stable marriage with covering constraints–a complete computational trichotomy
M Mnich, I Schlotter
International Symposium on Algorithmic Game Theory, 320-332, 2017
26*2017
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20