Martin Groß

Citace

	Všechny	Od 2020
Citace	546	362
h-index	12	9
i10-index	13	9

2011201220132014201520162017201820192020202120222023202420256 6 6 19 18 14 24 29 52 48 66 86 85 68 8

Veřejný přístup

Zobrazit všechny

13 článků

1 článek

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Melanie SchmidtHeinrich-Heine-Universität DüsseldorfE-mailová adresa ověřena na: hhu.de
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU BerlinE-mailová adresa ověřena na: tu-berlin.de
Daniel R. SchmidtHeinrich-Heine-Universität DüsseldorfE-mailová adresa ověřena na: uni-bonn.de
Jan-Philipp KappmeierSenior Software Engineer, TomTomE-mailová adresa ověřena na: math.tu-berlin.de
Lars ScheweSchool of Mathematics, University of EdinburghE-mailová adresa ověřena na: ed.ac.uk
Jannik MatuschkeKU LeuvenE-mailová adresa ověřena na: kuleuven.be
Jochen KoenemannUniversity of WaterlooE-mailová adresa ověřena na: uwaterloo.ca
Laura SanitàAssociate Professor, Bocconi University of MilanE-mailová adresa ověřena na: unibocconi.it
Samuel FioriniUniversité libre de BruxellesE-mailová adresa ověřena na: ulb.ac.be
Ashwin ArulselvanUniversity of StrathclydeE-mailová adresa ověřena na: strath.ac.uk
Ioana O. BerceaAssistant Professor, KTH Royal Institute of TechnologyE-mailová adresa ověřena na: kth.se
samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityE-mailová adresa ověřena na: northwestern.edu
Martin SchmidtTrier University - Department of MathematicsE-mailová adresa ověřena na: uni-trier.de
Yann DisserProfessor for Combinatorial Optimization, Department of Mathematics, TU DarmstadtE-mailová adresa ověřena na: mathematik.tu-darmstadt.de
Alexander MartinProfessor for Analytics & Optimization, University of Technology Nürnberg (UTN)E-mailová adresa ověřena na: utn.de
Herbert EggerJKU LinzE-mailová adresa ověřena na: jku.at
José VerschaeAssociate Professor, Pontificia Universidad Católica de ChileE-mailová adresa ověřena na: uc.cl
Ágnes CsehLecturer, University of BayreuthE-mailová adresa ověřena na: uni-bayreuth.de
David ManloveProfessor of Algorithms and Complexity, School of Computing Science, University of GlasgowE-mailová adresa ověřena na: glasgow.ac.uk
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityE-mailová adresa ověřena na: rutgers.edu

Sledovat

Martin Groß

RWTH Aachen

E-mailová adresa ověřena na: oms.rwth-aachen.de - Domovská stránka

Algorithms Optimization


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
On the cost of essentially fair clusterings IO Bercea, M Groß, S Khuller, A Kumar, C Rösner, DR Schmidt, ... arXiv preprint arXiv:1811.10319, 2018	131	2018
Approximating weighted tree augmentation via Chvátal-Gomory cuts S Fiorini, M Groß, J Könemann, L Sanità Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	70*	2018
On the use of network flow techniques for assigning evacuees to exits D Dressler, M Groß, JP Kappmeier, T Kelter, J Kulbatzki, D Plümpe, ... Procedia Engineering 3, 205-215, 2010	48	2010
Maximizing the storage capacity of gas networks: a global MINLP approach R Burlacu, H Egger, M Groß, A Martin, ME Pfetsch, L Schewe, M Sirvent, ... Optimization and Engineering 20 (2), 543-573, 2019	44	2019
Algorithmic results for potential‐based flows: Easy and hard cases M Groß, ME Pfetsch, L Schewe, M Schmidt, M Skutella Networks 73 (3), 306-324, 2019	43	2019
Generalized maximum flows over time M Groß, M Skutella Approximation and Online Algorithms: 9th International Workshop, WAOA 2011 …, 2012	43	2012
Matchings with lower quotas: Algorithms and complexity A Arulselvan, Á Cseh, M Groß, DF Manlove, J Matuschke Algorithmica 80, 185-208, 2018	28	2018
Approximating earliest arrival flows in arbitrary networks M Groß, JPW Kappmeier, DR Schmidt, M Schmidt Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012	28	2012
Maximum multicommodity flows over time without intermediate storage M Groß, M Skutella European Symposium on Algorithms, 539-550, 2012	21	2012
Approximation Algorithms for Complex Network Flow Over Time Problems M Groß	20	2014
A local-search algorithm for Steiner forest M Groß, A Gupta, A Kumar, J Matuschke, DR Schmidt, M Schmidt, ... arXiv preprint arXiv:1707.02753, 2017	16	2017
General bounds for incremental maximization A Bernstein, Y Disser, M Groß, S Himburg Mathematical Programming 191 (2), 953-979, 2022	13	2022
Scheduling maintenance jobs in networks F Abed, L Chen, Y Disser, M Groß, N Megow, J Meißner, AT Richter, ... Theoretical Computer Science 754, 107-121, 2019	11	2019
A tight bound on the speed-up through storage for quickest multi-commodity flows M Groß, M Skutella Operations Research Letters 43 (1), 93-95, 2015	8	2015
A global optimization approach for instationary gas transport in pipeline networks R Burlacu, H Egger, M Groß, A Martin, M Pfetsch, L Schewe, M Sirvent, ...	6	2018
Graph orientation and flows over time A Arulselvan, M Groß, M Skutella Networks 66 (3), 196-209, 2015	3	2015
Graph orientation and flows over time A Arulselvan, M Groß, M Skutella International Symposium on Algorithms and Computation, 741-752, 2014	3	2014
Middle-mile optimization for next-day delivery K Benidis, G Paschos, M Gross, G Iosifidis arXiv preprint arXiv:2310.18388, 2023	2	2023
9th Innovations in Theoretical Computer Science Conference (ITCS 2018) K Efremenko, A Garg, R Oliveira, A Wigderson, JY Cai, Z Fu, K Girstmair, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018	2	2018
Flows over time with commodity-dependent transit times M Groß Diplomarbeit (= Master's Thesis), TU Dortmund, 2009	2	2009

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři