Daniel Schmand

ORCID

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 33

Top Venues

CoRR

ICALP

Math. Oper. Res.

SIAM J. Discret. Math.

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution Discovery via Reconfiguration for Problems in P. ICALP (2024)
Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand
Asynchronous opinion dynamics in social networks. Distributed Comput. 37 (3) (2024)
Tim Oosterwijk, Daniel Schmand, Marc Schröder
Bicriteria Nash flows over time. Games Econ. Behav. 147 (2024)
Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. ICALP (2024)
Martin Hoefer, Kevin Schewior, Daniel Schmand
Stochastic Probing with Increasing Precision. SIAM J. Discret. Math. 38 (1) (2024)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. CoRR (2023)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. ECAI (2023)
Andreas Abels, Elias Pitschmann, Daniel Schmand
Prophet Inequalities over Time. EC (2023)
Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution discovery via reconfiguration for problems in P. CoRR (2023)
Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. CoRR (2023)
Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand
Asynchronous Opinion Dynamics in Social Networks. AAMAS (2022)
Andreas Abels, Elias Pitschmann, Daniel Schmand
Prophet-Inequalities over Time. CoRR (2022)
Tim Oosterwijk, Daniel Schmand, Marc Schröder
Bicriteria Nash Flows over Time. WINE (2022)
Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand
Asynchronous Opinion Dynamics in Social Networks. CoRR (2022)
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) (2022)
Tim Oosterwijk, Daniel Schmand, Marc Schröder
Bicriteria Nash Flows over Time. CoRR (2021)
Martin Hoefer, Kevin Schewior, Daniel Schmand
Stochastic Probing with Increasing Precision. IJCAI (2021)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45 (1) (2020)
Nils Bertschinger, Martin Hoefer, Daniel Schmand
Strategic Payments in Financial Networks. ITCS (2020)
Daniel Schmand, Marc Schröder, Laura Vargas Koch
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem. CoRR (2020)
Daniel Schmand, Marc Schröder, Alexander Skopalik
Network Investment Games with Wardrop Followers. ICALP (2019)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive stabilizers for unstable graphs. Discret. Optim. 31 (2019)
Max Klimm, Daniel Schmand, Andreas Tönnis
The Online Best Reply Algorithm for Resource Allocation Problems. SAGT (2019)
Nils Bertschinger, Martin Hoefer, Daniel Schmand
Strategic Payments in Financial Networks. CoRR (2019)
Daniel Schmand, Marc Schröder, Alexander Skopalik
Network Investment Game with Wardrop Followers. CoRR (2019)
Max Klimm, Daniel Schmand, Andreas Tönnis
Online Best Reply Algorithms for Resource Allocation Problems. CoRR (2018)
Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6 (1) (2018)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust flows over time: models and complexity results. Math. Program. 171 (1-2) (2018)
Antje Bjelde, Max Klimm, Daniel Schmand
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. SPAA (2017)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR (2016)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust Flows over Time: Models and Complexity Results. CoRR (2016)
Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. MFCS (2016)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive Stabilizers for Unstable Graphs. CoRR (2016)
Max Klimm, Daniel Schmand
Sharing Non-anonymous Costs of Multiple Resources Optimally. CIAC (2015)
Max Klimm, Daniel Schmand
Sharing Non-Anonymous Costs of Multiple Resources Optimally. CoRR (2014)

Daniel Schmand.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Schmand