Matthias Mnich

Navedeno

	Vse	Od leta 2019
Navedbe	1539	950
indeks h	22	17
indeks i10	46	33

180

135

200920102011201220132014201520162017201820192020202120222023202410 24 45 56 62 59 59 61 84 104 144 144 143 176 174 164

Javni dostop

Prikaži vse

39 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Dusan KnopCzech Technical University in PraguePreverjeni e-poštni naslov na fit.cvut.cz
Martin KouteckýCharles UniversityPreverjeni e-poštni naslov na iuuk.mff.cuni.cz
Erik Jan van LeeuwenUtrecht University, The NetherlandsPreverjeni e-poštni naslov na uu.nl
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonPreverjeni e-poštni naslov na rhul.ac.uk
Roland VinczePython DeveloperPreverjeni e-poštni naslov na uni-a.de
Neeldhara MisraIndian Institute of Technology, GandhinagarPreverjeni e-poštni naslov na iitgn.ac.in
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaPreverjeni e-poštni naslov na lau.edu.lb
Geevarghese PhilipFaculty Member at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
René van BevernHuawei Technologies Co., Ltd.Preverjeni e-poštni naslov na huawei.com
Leo van IerselAssociate professor, TU DelftPreverjeni e-poštni naslov na tudelft.nl
Andreas WieseAdjoint ProfessorPreverjeni e-poštni naslov na dii.uchile.cl
Kristóf BércziMatroid Optimization Research Group, Department of Operations Research, Eötvös Loránd UniversityPreverjeni e-poštni naslov na ttk.elte.hu
Anders YeoUniversity of Southern DenmarkPreverjeni e-poštni naslov na imada.sdu.dk
Sebastian LammKarlsruhe Institute of Technology (KIT)Preverjeni e-poštni naslov na kit.edu
Darren StrashHamilton CollegePreverjeni e-poštni naslov na hamilton.edu
Christian SchulzProfessor of Computer Science, Heidelberg UniversityPreverjeni e-poštni naslov na informatik.uni-heidelberg.de
Virginia Vassilevska WilliamsMITPreverjeni e-poštni naslov na mit.edu
Robert CrowstonRoyal Holloway, University of LondonPreverjeni e-poštni naslov na cs.rhul.ac.uk

Spremljaj

Matthias Mnich

TU Hamburg

Preverjeni e-poštni naslov na tuhh.de - Domača stran

Operations Research Algorithms Parameterized Complexity Graph Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Scheduling and fixed-parameter tractability M Mnich, A Wiese Mathematical Programming 154 (1), 533-562, 2015	101	2015
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R Van Bevern Computers & Operations Research 100, 254-261, 2018	81	2018
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming 184 (1-2), 1-34, 2020	77	2020
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015	76	2015
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	74	2009
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	63	2020
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	58	2011
A linear kernel for planar connected dominating set D Lokshtanov, M Mnich, S Saurabh Theoretical Computer Science 412 (23), 2536-2543, 2011	55	2011
Polynomial kernels for weighted problems M Etscheid, S Kratsch, M Mnich, H Röglin Journal of Computer and System Sciences 84, 1-10, 2017	48	2017
Domination when the stars are out D Hermelin, M Mnich, EJ Leeuwen, G Woeginger ACM Transactions on Algorithms (TALG) 15 (2), 1-90, 2019	44*	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	43	2008
Dynamic parameterized problems and algorithms J Alman, M Mnich, VV Williams ACM Transactions on Algorithms (TALG) 16 (4), 1-46, 2020	36	2020
Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich Algorithmica 72 (3), 734-757, 2015	32	2015
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	32*	2010
Linear kernels and linear-time algorithms for finding large cuts M Etscheid, M Mnich Algorithmica 80, 2574-2615, 2018	30	2018
Large independent sets in triangle-free planar graphs Z Dvorák, M Mnich SIAM journal on discrete mathematics 31 (2), 1355-1373, 2017	29	2017
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	29	2012
A 7/3-approximation for feedback vertex sets in tournaments M Mnich, VV Williams, LA Végh arXiv preprint arXiv:1511.01137, 2015	27	2015
Feedback vertex sets in tournaments S Gaspers, M Mnich Journal of Graph Theory 72 (1), 72-89, 2013	26	2013
Stable marriage with covering constraints–a complete computational trichotomy M Mnich, I Schlotter International Symposium on Algorithmic Game Theory, 320-332, 2017	25*	2017

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji