default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Schmand
Person information
- affiliation: University of Bremen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau
, Daniel Schmand:
Asynchronous opinion dynamics in social networks. Distributed Comput. 37(3): 207-224 (2024)- [j7]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash flows over time. Games Econ. Behav. 147: 19-37 (2024) - [j6]Martin Hoefer, Kevin Schewior, Daniel Schmand:
Stochastic Probing with Increasing Precision. SIAM J. Discret. Math. 38(1): 148-169 (2024) - [c13]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. ICALP 2024: 48:1-48:18 - [c12]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: 76:1-76:20 - 2023
- [c11]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: 700-707 - [c10]Andreas Abels, Elias Pitschmann, Daniel Schmand:
Prophet Inequalities over Time. EC 2023: 1-20 - [i14]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 abs/2304.14295 (2023) - [i13]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. CoRR abs/2311.02067 (2023) - [i12]Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz:
Solution discovery via reconfiguration for problems in P. CoRR abs/2311.13478 (2023) - 2022
- [j5]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) - [c9]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. AAMAS 2022: 109-117 - [c8]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. WINE 2022: 368 - [i11]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. CoRR abs/2201.12923 (2022) - [i10]Andreas Abels, Elias Pitschmann, Daniel Schmand:
Prophet-Inequalities over Time. CoRR abs/2211.10471 (2022) - 2021
- [c7]Martin Hoefer, Kevin Schewior, Daniel Schmand:
Stochastic Probing with Increasing Precision. IJCAI 2021: 4069-4075 - [i9]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. CoRR abs/2111.08589 (2021) - 2020
- [j4]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): 323-352 (2020) - [c6]Nils Bertschinger, Martin Hoefer, Daniel Schmand:
Strategic Payments in Financial Networks. ITCS 2020: 46:1-46:16 - [i8]Daniel Schmand, Marc Schröder, Laura Vargas Koch:
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem. CoRR abs/2007.10704 (2020)
2010 – 2019
- 2019
- [b1]Daniel Schmand:
Strategic Decisions and Uncertainties. RWTH Aachen University, Germany, Dr. Hut 2019, ISBN 978-3-8439-4030-6, pp. 1-185 - [j3]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive stabilizers for unstable graphs. Discret. Optim. 31: 56-78 (2019) - [c5]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Games with Wardrop Followers. ICALP 2019: 151:1-151:14 - [c4]Max Klimm, Daniel Schmand, Andreas Tönnis:
The Online Best Reply Algorithm for Resource Allocation Problems. SAGT 2019: 200-215 - [i7]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Game with Wardrop Followers. CoRR abs/1904.10417 (2019) - [i6]Nils Bertschinger, Martin Hoefer, Daniel Schmand:
Strategic Payments in Financial Networks. CoRR abs/1908.01714 (2019) - 2018
- [j2]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): 55-85 (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) - [i5]Max Klimm, Daniel Schmand, Andreas Tönnis:
Online Best Reply Algorithms for Resource Allocation Problems. CoRR abs/1805.02526 (2018) - 2017
- [c3]Antje Bjelde, Max Klimm, Daniel Schmand:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. SPAA 2017: 227-229 - 2016
- [c2]Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. MFCS 2016: 49:1-49:14 - [i4]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 abs/1604.08125 (2016) - [i3]Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust Flows over Time: Models and Complexity Results. CoRR abs/1608.06520 (2016) - [i2]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive Stabilizers for Unstable Graphs. CoRR abs/1608.06797 (2016) - 2015
- [c1]Max Klimm, Daniel Schmand:
Sharing Non-anonymous Costs of Multiple Resources Optimally. CIAC 2015: 274-287 - 2014
- [i1]Max Klimm, Daniel Schmand:
Sharing Non-Anonymous Costs of Multiple Resources Optimally. CoRR abs/1412.4456 (2014)
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-20 22:56 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:
