% This file was created by ZeTeM Website
 
% Daniel Schmand




@INBOOK{Schmand2021_79bdb,
  author = {Daniel Schmand},
  chapter = {Recent Developments in Mathematical Traffic Models},
  title = {Dynamics in Logistics},
  editor = {Michael Freitag and Herbert Kotzab and Nicole Megow},
  pages = {71-78},
  publisher = {Springer Verlag},
  year = {2021},
  doi = {10.1007/978-3-030-88662-2_4}
}


@ARTICLE{Berenbrink2024_a6ef1,
  author = {Petra Berenbrink and Martin Hoefer and Dominik Kaaser and Pascal Lenzner and Malin Rau and Daniel Schmand},
  title = {Asynchronous opinion dynamics in social networks},
  journal = {Distributed Computing},
  annote = {prelim. version at AAMAS 2022.},
  year = {2024},
  doi = {10.1007/s00446-024-00467-3}
}


@ARTICLE{Bertschinger2024_3b15f,
  author = {Nils Bertschinger and Martin Hoefer and Daniel Schmand},
  title = {Flow Allocation Games},
  journal = {Mathematics of Operations Research},
  annote = {prelim. version at ITCS 2020.},
  pages = {1-22},
  year = {2024},
  doi = {10.1287/moor.2022.0355}
}


@ARTICLE{Hoefer2024_3eac8,
  author = {Martin Hoefer and Kevin Schewior and Daniel Schmand},
  title = {Stochastic Probing with Increasing Precision},
  journal = {SIAM Journal on Discrete Mathematics},
  annote = {prelim. version at IJCAI 2021.},
  volume = {28},
  number = {1},
  pages = {148-169},
  publisher = {SIAM},
  year = {2024},
  doi = {10.1137/22M149466X}
}


@ARTICLE{Schmand2022_df19a,
  author = {Daniel Schmand and Marc Schröder and Laura Vargas Koch},
  title = {A greedy algorithm for the social golfer and the Oberwolfach problem},
  journal = {European Journal of Operational Research},
  volume = {300},
  number = {1},
  pages = {310-319},
  publisher = {Elsevier},
  year = {2022},
  doi = {10.1016/j.ejor.2021.09.018}
}


@ARTICLE{Disser2020_3510c,
  author = {Yann Disser and John Fearnley and Martin Gairing and Oliver Göbel and Max Klimm and Daniel Schmand and Alexander Skopalik and Andreas Tönnis},
  title = {Hiring Secretaries over Time: The Benefit of Concurrent Employment.},
  journal = {Mathematics of Operations Research},
  volume = {45},
  number = {1},
  pages = {323-352},
  year = {2020},
  doi = {10.1287/moor.2019.0993}
}


@ARTICLE{Chandrasekaran2019_ef3cc,
  author = {Karthekeyan Chandrasekaran and Corinna Gottschalk and Jochen Könemann and Britta Peis and Daniel Schmand and Andreas Wierz},
  title = {Additive stabilizers for unstable graphs},
  journal = {Discrete Optimization},
  volume = {31},
  pages = {56-78},
  year = {2019},
  doi = {10.1016/j.disopt.2018.08.003}
}


@ARTICLE{Harks2018_becca,
  author = {Tobias Harks and Britta Peis and Daniel Schmand and Björn Tauer and Laura Vargas Koch},
  title = {Competitive Packet Routing with Priority Lists},
  journal = {ACM Transactions on Economics and Computation},
  annote = {prelim. version at MFCS 2016.},
  volume = {6},
  number = {1},
  pages = {4:1--4:26},
  year = {2018},
  doi = {10.1145/3184137}
}


@ARTICLE{Gottschalk2018_88f76,
  author = {Corinna Gottschalk and Arie Koster and Frauke Liers and Britta Peis and Daniel Schmand and Andreas Wierz},
  title = {Robust flows over time: models and complexity results},
  journal = {Mathematical Programming},
  volume = {171},
  number = {1},
  pages = {55-85},
  year = {2018},
  doi = {10.1007/s10107-017-1170-3}
}





@CONFERENCE{Fellows2023_90914,
  author = {Michael R. Fellows and Mario Grobler and Nicole Megow and Amer E. Mouawad and Vijayaragunathan Ramamoorthi and Frances A. Rosamond and Daniel Schmand and Sebastian Siebertz},
  title = {On Solution Discovery via Reconfiguration},
  booktitle = {26th European Conference on Artificial Intelligence (ECAI 2023), Krakau, Polen},
  pages = {700-707},
  year = {2023},
  doi = {10.3233/FAIA230334}
}


@CONFERENCE{Abels2023_bbeb1,
  author = {Andreas Abels and Elias Pitschmann and Daniel Schmand},
  title = {Prophet Inequalities over Time},
  booktitle = {24th ACM Conference on Economics and Computation (EC 2023), London, Großbritannien},
  year = {2023},
  doi = {10.1145/3580507.3597741}
}


@CONFERENCE{Berenbrink2022_4be1c,
  author = {Petra Berenbrink and Martin Hoefer and Dominik Kaaser and Pascal Lenzner and Malin Rau and Daniel Schmand},
  title = {Asynchronous Opinion Dynamics in Social Networks},
  booktitle = {21st International Joint Conference on Autonomous Agents & Multiagent Systems (AAMAS 2022), Auckland, Neuseeland},
  year = {2022}
}


@CONFERENCE{Oosterwijk2022_5e72a,
  author = {Tim Oosterwijk and Daniel Schmand and Marc Schröder},
  title = {Bicriteria Nash Flows over Time},
  booktitle = {18th International Conference on Web and Internet Economics (WINE 2022)},
  year = {2022},
  doi = {10.48550/arXiv.2111.08589}
}


@CONFERENCE{Hoefer2021_3eac8,
  author = {Martin Hoefer and Kevin Schewior and Daniel Schmand},
  title = {Stochastic Probing with Increasing Precision},
  booktitle = {2021 International Joint Conference on Artificial Intelligence (IJCAI 2021), Montreal, Kanada},
  year = {2021},
  doi = {10.24963/ijcai.2021/560}
}


@CONFERENCE{Bertschinger2020_ad855,
  author = {Nils Bertschinger and Martin Hoefer and Daniel Schmand},
  title = {Strategic Payments in Financial Networks},
  booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  volume = {151},
  pages = {46:1--46:16},
  year = {2020},
  doi = {10.4230/LIPIcs.ITCS.2020.46}
}


@CONFERENCE{Schmand2019_b7856,
  author = {Daniel Schmand and Marc Schröder and Alexander Skopalik},
  title = {Network Investment Games with Wardrop Followers},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  year = {2019},
  doi = {10.4230/LIPIcs.ICALP.2019.151}
}


@CONFERENCE{Klimm2019_827fa,
  author = {Max Klimm and Andreas Tönnis and Daniel Schmand},
  title = {The Online Best Reply Algorithm for Resource Allocation Problems},
  booktitle = {12th International Symposium on Algorithmic Game Theory (SAGT 2019)},
  year = {2019},
  doi = {10.1007/978-3-030-30473-7_14}
}


@CONFERENCE{Bjelde2017_32153,
  author = {Antje Bjelde and Max Klimm and Daniel Schmand},
  title = {Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale},
  booktitle = {29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017)},
  year = {2017},
  doi = {10.1145/3087556.3087597}
}


@CONFERENCE{Harks2016_becca,
  author = {Tobias Harks and Britta Peis and Daniel Schmand and Björn Tauer and Laura Vargas Koch},
  title = {Competitive Packet Routing with Priority Lists},
  booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakau, Polen},
  year = {2016},
  doi = {10.4230/LIPIcs.MFCS.2016.49}
}


@CONFERENCE{Klimm2015_108e5,
  author = {Max Klimm and Daniel Schmand},
  title = {Sharing Non-anonymous Costs of Multiple Resources Optimally},
  booktitle = {9th International Conference on Algorithms and Complexity (CIAC 2015)},
  year = {2015},
  doi = {10.1007/978-3-319-18173-8_20}
}