default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Vargas Koch
Person information
- affiliation: RWTH Aachen University, Germany
- affiliation (former): University of Bonn, Germany
- affiliation (former): ETH Zurich, Switzerland
- affiliation (former): RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Laura Vargas Koch
, Lukas Vogl:
The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al. Discret. Math. 347(6): 113958 (2024)- 2023
- [j4]Leon Sering, Laura Vargas Koch, Theresa Ziemke:
Convergence of a Packet Routing Model to Flows over Time. Math. Oper. Res. 48(3): 1741-1766 (2023) - 2022
- [j3]Daniel Schmand, Marc Schröder, Laura Vargas Koch:
A greedy algorithm for the social golfer and the Oberwolfach problem. Eur. J. Oper. Res. 300(1): 310-319 (2022) - [j2]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Routing Games with Edge Priorities. ACM Trans. Economics and Comput. 10(1): 1:1-1:27 (2022) - 2018
- [j1]Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6(1): 4:1-4:26 (2018)
Conference and Workshop Papers
- 2024
- [c12]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. SODA 2024: 639-668 - 2023
- [c11]Neil Olver, Leon Sering, Laura Vargas Koch:
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. FOCS 2023: 123-133 - [c10]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA 2023: 96-102 - 2022
- [c9]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. ESA 2022: 7:1-7:14 - 2021
- [c8]Neil Olver, Leon Sering, Laura Vargas Koch:
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. FOCS 2021: 851-860 - [c7]Leon Sering, Laura Vargas Koch, Theresa Ziemke:
Convergence of a Packet Routing Model to Flows Over Time. EC 2021: 797-816 - [c6]Bjoern Tauer, Laura Vargas Koch:
FIFO and Randomized Competitive Packet Routing Games. WAOA 2021: 165-187 - 2020
- [c5]Bjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger:
Waiting for Trains: Complexity Results. CALDAM 2020: 282-303 - 2019
- [c4]Leon Sering, Laura Vargas Koch:
Nash Flows Over Time with Spillback. SODA 2019: 935-945 - 2018
- [c3]Britta Peis, Bjoern Tauer, Veerle Timmermans, Laura Vargas Koch:
Oligopolistic Competitive Packet Routing. ATMOS 2018: 13:1-13:22 - [c2]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Equilibria in Routing Games with Edge Priorities. WINE 2018: 408-422 - 2016
- [c1]Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. MFCS 2016: 49:1-49:14
Informal and Other Publications
- 2024
- [i12]Neil Olver, Leon Sering, Laura Vargas Koch:
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. CoRR abs/2402.04935 (2024) - [i11]José R. Correa, Andrés Cristi, Laura Vargas Koch:
The Simplicity of Optimal Dynamic Mechanisms. CoRR abs/2410.11738 (2024) - 2023
- [i10]Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch:
A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR abs/2304.14262 (2023) - [i9]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. CoRR abs/2308.02651 (2023) - [i8]Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh:
Faster Ascending Auctions via Polymatroid Sum. CoRR abs/2310.08454 (2023) - 2022
- [i7]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. CoRR abs/2207.02609 (2022) - [i6]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. CoRR abs/2211.03601 (2022) - 2021
- [i5]Leon Sering, Laura Vargas Koch, Theresa Ziemke:
Convergence of a Packet Routing Model to Flows Over Time. CoRR abs/2105.13202 (2021) - [i4]Neil Olver, Leon Sering, Laura Vargas Koch:
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. CoRR abs/2111.06877 (2021) - 2020
- [i3]Daniel Schmand, Marc Schröder, Laura Vargas Koch:
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem. CoRR abs/2007.10704 (2020) - 2018
- [i2]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Nash equilibria in routing games with edge priorities. CoRR abs/1803.00865 (2018) - [i1]Leon Sering, Laura Vargas Koch:
Nash Flows over Time with Spillback. CoRR abs/1807.05862 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
