Published in: OASIcs, Volume 106, 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)
Lukas Graf, Tobias Harks, and Prashant Palkar. Dynamic Traffic Assignment for Electric Vehicles. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 6:1-6:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{graf_et_al:OASIcs.ATMOS.2022.6, author = {Graf, Lukas and Harks, Tobias and Palkar, Prashant}, title = {{Dynamic Traffic Assignment for Electric Vehicles}}, booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)}, pages = {6:1--6:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-259-4}, ISSN = {2190-6807}, year = {2022}, volume = {106}, editor = {D'Emidio, Mattia and Lindner, Niels}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.6}, URN = {urn:nbn:de:0030-drops-171104}, doi = {10.4230/OASIcs.ATMOS.2022.6}, annote = {Keywords: Electromobility, Dynamic Traffic Assignment, Dynamic Flows, Fixed Point Algorithm} }
Published in: Dagstuhl Reports, Volume 8, Issue 3 (2018)
Roberto Cominetti, Tobias Harks, Carolina Osorio, and Britta Peis. Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). In Dagstuhl Reports, Volume 8, Issue 3, pp. 21-38, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@Article{cominetti_et_al:DagRep.8.3.21, author = {Cominetti, Roberto and Harks, Tobias and Osorio, Carolina and Peis, Britta}, title = {{Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102)}}, pages = {21--38}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2018}, volume = {8}, number = {3}, editor = {Cominetti, Roberto and Harks, Tobias and Osorio, Carolina and Peis, Britta}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.21}, URN = {urn:nbn:de:0030-drops-92954}, doi = {10.4230/DagRep.8.3.21}, annote = {Keywords: Algorithm and complexity of traffic equilibrium computation, dynamic traffic assignment models, Simulation and network optimization} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Tobias Harks, Martin Hoefer, Anja Huber, and Manuel Surek. Efficient Black-Box Reductions for Separable Cost Sharing. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 154:1-154:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{harks_et_al:LIPIcs.ICALP.2018.154, author = {Harks, Tobias and Hoefer, Martin and Huber, Anja and Surek, Manuel}, title = {{Efficient Black-Box Reductions for Separable Cost Sharing}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {154:1--154:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.154}, URN = {urn:nbn:de:0030-drops-91587}, doi = {10.4230/LIPIcs.ICALP.2018.154}, annote = {Keywords: Cost Sharing, Price of Stability, Matroids, Connection Games} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Tobias Harks, Britta Peis, Daniel Schmand, and Laura Vargas Koch. Competitive Packet Routing with Priority Lists. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 49:1-49:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{harks_et_al:LIPIcs.MFCS.2016.49, author = {Harks, Tobias and Peis, Britta and Schmand, Daniel and Vargas Koch, Laura}, title = {{Competitive Packet Routing with Priority Lists}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {49:1--49:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.49}, URN = {urn:nbn:de:0030-drops-64622}, doi = {10.4230/LIPIcs.MFCS.2016.49}, annote = {Keywords: packet routing, Nash equilibrium, price of anarchy, priority policy, complexity} }
Published in: Dagstuhl Reports, Volume 5, Issue 10 (2016)
José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, and Martin Skutella. Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). In Dagstuhl Reports, Volume 5, Issue 10, pp. 19-34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Article{correa_et_al:DagRep.5.10.19, author = {Correa, Jos\'{e} R. and Harks, Tobias and Nagel, Kai and Peis, Britta and Skutella, Martin}, title = {{Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412)}}, pages = {19--34}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {10}, editor = {Correa, Jos\'{e} R. and Harks, Tobias and Nagel, Kai and Peis, Britta and Skutella, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.10.19}, URN = {urn:nbn:de:0030-drops-56938}, doi = {10.4230/DagRep.5.10.19}, annote = {Keywords: Dynamic traffic equilibria, Complexity of equilibrium computation, Simulation, Dynamic network flow theory, Network optimization} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Martin Gairing, Tobias Harks, and Max Klimm. Complexity and Approximation of the Continuous Network Design Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 226-241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{gairing_et_al:LIPIcs.APPROX-RANDOM.2014.226, author = {Gairing, Martin and Harks, Tobias and Klimm, Max}, title = {{Complexity and Approximation of the Continuous Network Design Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {226--241}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.226}, URN = {urn:nbn:de:0030-drops-46998}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.226}, annote = {Keywords: Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit} }
Feedback for Dagstuhl Publishing