Results 1-20 of 28

Issue DateTitleTypeAuthor(s)
117-Jan-2022Fulltext availableOpen AccessOptimizing fuel consumption on inland waterway networks : local search heuristic for lock schedulingArticleGolak, Julian ; Defryn, Christof ; Grigoriev, Alexander 
215-Nov-2021Fulltext availableOpen AccessParameterized complexity of configuration integer programsArticleKnop, Dušan ; Koutecký, Martin ; Levin, Asaf ; Mnich, Matthias  ; Onn, Shmuel 
315-Sep-2021Fulltext availableOpen AccessHitting weighted even cycles in planar graphsChapter/Article (Proceedings)Göke, Alexander ; Koenemann, Jochen ; Mnich, Matthias  ; Sun, Hao 
429-Jun-2021Cycle spectra of contraction-critically 4-connected planar graphsArticleLo, On-Hei Solomon ; Schmidt, Jens M.  
522-Apr-2021Fulltext availableOpen AccessReachability switching gamesArticleFearnley, John ; Gairing, Martin ; Mnich, Matthias  ; Savani, Rahul 
6Jan-2021Fulltext availableOpen AccessCircumference of essentially 4-connected planar triangulationsArticleFabrici, Igor ; Harant, Jochen ; Mohr, Samuel ; Schmidt, Jens M.  
72021On short fastest paths in temporal graphsChapter/Article (Proceedings)Danda, Umesh Sandeep ; Ramakrishna, G. ; Schmidt, Jens M.  ; Srikanth, M. 
82021Approximating sparsest cut in low-treewidth graphs via combinatorial diameterPreprintChalermsook, Parinya ; Kaul, Matthias ; Mnich, Matthias  ; Spoerhase, Joachim ; Uniyal, Sumedha ; Vaz, Daniel 
92021Efficient approximations for many-visits multiple traveling salesman problemsPreprintBérczi, Kristóf ; Mnich, Matthias  ; Vincze, Roland  
10Aug-2020On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikesArticleAbiad, Aida ; Gribling, Sander ; Lahaye, Domenico ; Mnich, Matthias  ; Regts, Guus ; Vena, Luis ; Verweij, Gerard ; Zwaneveld, Peter 
11May-2020Scheduling with non-renewable resources: Minimizing the sum of completion timesChapter/Article (Proceedings)Bérczi, Kristóf ; Király, Tamás ; Omlor, Simon 
126-Feb-2020Fulltext availableOpen AccessStable matchings with covering constraints: a complete computational trichotomyArticleMnich, Matthias  ; Schlotter, Ildikó 
132020Fulltext availableOpen AccessHitting long directed cycles is fixed-parameter tractableChapter/Article (Proceedings)Göke, Alexander ; Marx, Dániel ; Mnich, Matthias  
142020Dense Steiner problems: approximation algorithms and inapproximabilityPreprintKarpinski, Marek ; Lewandowski, Mateusz ; Meesum, Syed Mohammad ; Mnich, Matthias  
152020A 3/2-approximation for the metric many-visits path TSPPreprintBérczi, Kristóf ; Mnich, Matthias  ; Vincze, Roland  
162020Time- and space-optimal algorithm for the many-visits TSPArticleBerger, André ; Kozma, László ; Mnich, Matthias  ; Vincze, Roland  
172020Voting and bribing in single-exponential timeArticleKnop, Dušan ; Koutecký, Martin ; Mnich, Matthias  
182020Dynamic parameterized problems and algorithmsArticleAlman, Josh ; Mnich, Matthias  ; Vassilevska Williams, Virginia 
192020Fulltext availableOpen AccessSolving packing problems with few small items using rainbow matchingsChapter/Article (Proceedings)Bannach, Max ; Berndt, Sebastian ; Maack, Marten ; Mnich, Matthias  ; Lassota, Alexandra ; Rau, Malin ; Skambath, Malte 
202020Engineering kernelization for maximum cutChapter/Article (Proceedings)Ferizovic, Damir ; Hespe, Damian ; Lamm, Sebastian ; Mnich, Matthias  ; Schulz, Christian ; Strash, Darren