Heiko Röglin - RankMe

133 papers A* 13A 15B 13C 4Journal 74Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parameterized Algorithms for the Drone Delivery Problem. CoRR Simon Bartlmae, Andreas Hene, Joshua Könen, Heiko Röglin
2026	J	`jnl`	The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics. CoRR Henri Nikoleit, Ankit Anand, Anurag Murty Naredla, Heiko Röglin
2025	A	`conf`	Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. STACS Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025	J	`jnl`	Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. CoRR Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025	J	`jnl`	Bicriteria Shapes: Hierarchical Grouping and Aggregation of Polygons with an Efficient Graph-Cut Approach. ACM Trans. Spatial Algorithms Syst. Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert
2025	A	`conf`	Connected k-Median with Disjoint and Non-Disjoint Clusters. ESA Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt
2025	J	`jnl`	Connected k-Median with Disjoint and Non-disjoint Clusters. CoRR Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt
2025	J	`jnl`	New Algorithms and Hardness Results for Connected Clustering. CoRR Jan Eube, Heiko Röglin
2025	J	`jnl`	On the number of iterations of the DBA algorithm. Data Min. Knowl. Discov. Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin
2025	A	`conf`	Parameterized Algorithms for Computing Pareto Sets. ESA Joshua Könen, Heiko Röglin, Tarek Stuck
2025	J	`jnl`	Parameterized Algorithms for Computing Pareto Sets. CoRR Joshua Könen, Heiko Röglin, Tarek Stuck
2025	B	`conf`	Parameterized Algorithms for the Drone Delivery Problem. ISAAC Simon Bartlmae, Andreas Hene, Joshua Könen, Heiko Röglin
2025	J	`jnl`	The Price of Hierarchical Clustering. Algorithmica Anna Arutyunova, Heiko Röglin
2024	A*	`conf`	Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering. NeurIPS Anna Arutyunova, Jan Eube, Heiko Röglin, Melanie Schmidt, Sarah Sturm, Julian Wargalla
2024	J	`jnl`	Connected k-Center and k-Diameter Clustering. Algorithmica Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2024	A	`conf`	On the number of iterations of the DBA algorithm. SDM Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin
2024	J	`jnl`	On the number of iterations of the DBA algorithm. CoRR Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin
2024	J	`jnl`	Upper and lower bounds for complete linkage in general metric spaces. Mach. Learn. Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2023	A*	`conf`	Connected k-Center and k-Diameter Clustering. ICALP Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2023	J	`jnl`	The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking
2023	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR Matthias Englert, Heiko Röglin, Berthold Vöcking
2022	J	`jnl`	Connected k-Center and k-Diameter Clustering. CoRR Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2022	A*	`conf`	Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	J	`jnl`	Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	J	`jnl`	Minimum-error triangulations for sea surface reconstruction. J. Comput. Geom. Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
2022	A	`conf`	The Price of Hierarchical Clustering. ESA Anna Arutyunova, Heiko Röglin
2022	J	`jnl`	The Price of Hierarchical Clustering. CoRR Anna Arutyunova, Heiko Röglin
2021	—	`conf`	Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert
2021	—	`conf`	Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2020	A	`conf`	Noisy, Greedy and Not so Greedy k-Means++. ESA Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt
2020	J	`jnl`	Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
2020	—	`ch.`	Smoothed Analysis of Pareto Curves in Multiobjective Optimization. Beyond the Worst-Case Analysis of Algorithms Heiko Röglin
2020	J	`jnl`	Smoothed Analysis of Pareto Curves in Multiobjective Optimization. CoRR Heiko Röglin
2019	A*	`conf`	Analysis of Ward's Method. SODA Anna Großwendt, Heiko Röglin, Melanie Schmidt
2019	J	`jnl`	Analysis of Ward's Method. CoRR Anna Großwendt, Heiko Röglin, Melanie Schmidt
2019	J	`jnl`	Noisy, Greedy and Not So Greedy k-means++. CoRR Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt
2018	J	`jnl`	New deterministic algorithms for solving parity games. Discret. Optim. Matthias Mnich, Heiko Röglin, Clemens Rösner
2018	B	`conf`	Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. LATIN Carsten Fischer, Heiko Röglin
2018	J	`jnl`	The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms Alantha Newman, Heiko Röglin, Johanna Seif
2017	J	`jnl`	Improved Analysis of Complete-Linkage Clustering. Algorithmica Anna Großwendt, Heiko Röglin
2017	J	`jnl`	Polynomial kernels for weighted problems. J. Comput. Syst. Sci. Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2017	J	`jnl`	Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal
2017	J	`jnl`	Smoothed Analysis of Local Search for the Maximum-Cut Problem. ACM Trans. Algorithms Michael Etscheid, Heiko Röglin
2017	C	`conf`	The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. TAMC Heiko Röglin, Clemens Rösner
2016	—	`conf`	Bounds for the Convergence Time of Local Search in Scheduling Problems. WINE Tobias Brunsch, Michael Etscheid, Heiko Röglin
2016	B	`conf`	New Deterministic Algorithms for Solving Parity Games. LATIN Matthias Mnich, Heiko Röglin, Clemens Rösner
2016	B	`conf`	Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. LATIN Carsten Fischer, Heiko Röglin
2016	J	`jnl`	Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms Matthias Englert, Heiko Röglin, Berthold Vöcking
2016	—	`ch.`	Smoothed Analysis. Encyclopedia of Algorithms Heiko Röglin
2016	A	`conf`	The Alternating Stock Size Problem and the Gasoline Puzzle. ESA Alantha Newman, Heiko Röglin, Johanna Seif
2015	A	`conf`	Improved Analysis of Complete-Linkage Clustering. ESA Anna Großwendt, Heiko Röglin
2015	J	`jnl`	Improved Smoothed Analysis of Multiobjective Optimization. J. ACM Tobias Brunsch, Heiko Röglin
2015	J	`jnl`	Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. André Berger, Heiko Röglin, Ruben van der Zwaan
2015	J	`jnl`	New Deterministic Algorithms for Solving Parity Games. CoRR Matthias Mnich, Heiko Röglin, Clemens Rösner
2015	—	`conf`	Polynomial Kernels for Weighted Problems. MFCS (2) Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2015	J	`jnl`	Polynomial Kernels for Weighted Problems. CoRR Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2015	J	`jnl`	Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. CoRR Carsten Fischer, Heiko Röglin
2015	A	`conf`	Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. ESA Michael Etscheid, Heiko Röglin
2015	J	`jnl`	Smoothed Analysis of the Successive Shortest Path Algorithm. CoRR Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2015	J	`jnl`	Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2015	A	`conf`	Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. STACS Tobias Brunsch, Anna Großwendt, Heiko Röglin
2015	J	`jnl`	The Alternating Stock Size Problem and the Gasoline Puzzle. CoRR Alantha Newman, Heiko Röglin, Johanna Seif
2014	J	`jnl`	Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372). Dagstuhl Reports Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden
2014	J	`jnl`	Efficient Clustering with Limited Distance Information. CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2014	J	`jnl`	Lower Bounds for the Average and Smoothed Number of Pareto-Optima. Theory Comput. Tobias Brunsch, Navin Goyal, Luis Rademacher, Heiko Röglin
2014	A*	`conf`	Smoothed Analysis of Local Search for the Maximum-Cut Problem. SODA Michael Etscheid, Heiko Röglin
2014	J	`jnl`	Smoothed performance guarantees for local search. Math. Program. Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
2014	J	`jnl`	Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. CoRR Tobias Brunsch, Anna Großwendt, Heiko Röglin
2014	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica Matthias Englert, Heiko Röglin, Berthold Vöcking
2013	J	`jnl`	A bad instance for k-means++. Theor. Comput. Sci. Tobias Brunsch, Heiko Röglin
2013	J	`jnl`	Economical Caching. ACM Trans. Comput. Theory Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2013	J	`jnl`	Finding Short Paths on Polytopes by the Shadow Vertex Algorithm CoRR Tobias Brunsch, Heiko Röglin
2013	—	`conf`	Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. ICALP (1) Tobias Brunsch, Heiko Röglin
2013	B	`conf`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	J	`jnl`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	A*	`conf`	Smoothed Analysis of the Successive Shortest Path Algorithm. SODA Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	C	`conf`	Smoothed analysis of the successive shortest path algorithm. CTW Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	J	`jnl`	Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. J. Comput. Geom. Bodo Manthey, Heiko Röglin
2012	J	`jnl`	Active Clustering of Biological Sequences. J. Mach. Learn. Res. Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2012	J	`jnl`	Computing approximate Nash equilibria in network congestion games. Networks Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
2012	A*	`conf`	Improved smoothed analysis of multiobjective optimization. STOC Tobias Brunsch, Heiko Röglin
2012	J	`jnl`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching CoRR Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2012	J	`jnl`	Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2011	C	`conf`	A Bad Instance for k-Means++. TAMC Tobias Brunsch, Heiko Röglin
2011	J	`jnl`	Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2011	J	`jnl`	Competitive routing over time. Theor. Comput. Sci. Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
2011	J	`jnl`	Improved Smoothed Analysis of Multiobjective Optimization CoRR Tobias Brunsch, Heiko Röglin
2011	C	`conf`	Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC Tobias Brunsch, Heiko Röglin
2011	—	`conf`	Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2011	B	`conf`	Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA André Berger, Heiko Röglin, Ruben van der Zwaan
2011	J	`jnl`	Smoothed Analysis of the k-Means Method. J. ACM David Arthur, Bodo Manthey, Heiko Röglin
2011	J	`jnl`	Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it Inf. Technol. Bodo Manthey, Heiko Röglin
2011	J	`jnl`	Smoothed Performance Guarantees for Local Search CoRR Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
2011	A	`conf`	Smoothed Performance Guarantees for Local Search. ESA Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
2011	J	`jnl`	Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2010	—	`conf`	Analysis of Algorithms. Algorithm Engineering Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer
2010	J	`jnl`	Efficient Clustering with Limited Distance Information CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2010	A	`conf`	Efficient Clustering with Limited Distance Information. UAI Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2010	J	`jnl`	Lower Bounds for the Smoothed Number of Pareto optimal Solutions CoRR Tobias Brunsch, Heiko Röglin
2010	B	`conf`	The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA Patrick Briest, Heiko Röglin
2010	—	`conf`	Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2009	B	`conf`	Agnostic Clustering. ALT Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng
2009	—	`conf`	Competitive Routing over Time. WINE Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
2009	A	`conf`	Economical Caching. STACS Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2009	J	`jnl`	Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics Matthias Englert, Heiko Röglin, Matthias Westermann
2009	A*	`conf`	Improved smoothed analysis of the SODA Bodo Manthey, Heiko Röglin
2009	J	`jnl`	Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2009	A*	`conf`	Smoothed Analysis of Multiobjective Optimization. FOCS Heiko Röglin, Shang-Hua Teng
2009	J	`jnl`	Uncoordinated two-sided matching markets. SIGecom Exch. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2009	B	`conf`	Worst-Case and Smoothed Analysis of ISAAC Bodo Manthey, Heiko Röglin
2009	A*	`conf`	k-Means Has Polynomial Smoothed Complexity. FOCS David Arthur, Bodo Manthey, Heiko Röglin
2009	J	`jnl`	k-Means has Polynomial Smoothed Complexity CoRR David Arthur, Bodo Manthey, Heiko Röglin
2008	J	`jnl`	A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2008	J	`jnl`	Approximate Equilibria in Games with Few Players CoRR Patrick Briest, Paul W. Goldberg, Heiko Röglin
2008	B	`conf`	Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
2008	J	`jnl`	Improved Smoothed Analysis of the k-Means Method CoRR Bodo Manthey, Heiko Röglin
2008	J	`jnl`	On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games CoRR Heiner Ackermann, Heiko Röglin
2008	J	`jnl`	On the impact of combinatorial structure on congestion games. J. ACM Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2008	A*	`conf`	Uncoordinated two-sided matching markets. EC Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2007	—	`conf`	A Unified Approach to Congestion Games and Two-Sided Markets. WINE Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
2007	J	`jnl`	Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
2007	J	`jnl`	Smoothed analysis of integer programming. Math. Program. Heiko Röglin, Berthold Vöcking
2007	B	`conf`	The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO René Beier, Heiko Röglin, Berthold Vöcking
2007	A*	`conf`	Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA Matthias Englert, Heiko Röglin, Berthold Vöcking
2006	—	`conf`	Evaluation of Online Strategies for Reordering Buffers. WEA Matthias Englert, Heiko Röglin, Matthias Westermann
2006	A*	`conf`	On the Impact of Combinatorial Structure on Congestion Games. FOCS Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	J	`jnl`	On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	—	`conf`	Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE Heiner Ackermann, Heiko Röglin, Berthold Vöcking
2006	J	`jnl`	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. Matthias Englert, Heiko Röglin, Berthold Vöcking
2005	B	`conf`	Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
2005	B	`conf`	Smoothed Analysis of Integer Programming. IPCO Heiko Röglin, Berthold Vöcking
2004	A	`conf`	Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2004	A	`conf`	The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener