Published in: OASIcs, Volume 89, 2nd International Conference of the DFG International Research Training Group 2057 – Physical Modeling for Virtual Manufacturing (iPMVM 2020)
Daniel Müller, Benjamin Kirsch, and Jan C. Aurich. Influence of Flank Face Structuring on Cooling, Tool Lifetime and Borehole Quality When Drilling Inconel 718: Physical Simulations and Experimental Validation. In 2nd International Conference of the DFG International Research Training Group 2057 – Physical Modeling for Virtual Manufacturing (iPMVM 2020). Open Access Series in Informatics (OASIcs), Volume 89, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{muller_et_al:OASIcs.iPMVM.2020.7, author = {M\"{u}ller, Daniel and Kirsch, Benjamin and Aurich, Jan C.}, title = {{Influence of Flank Face Structuring on Cooling, Tool Lifetime and Borehole Quality When Drilling Inconel 718: Physical Simulations and Experimental Validation}}, booktitle = {2nd International Conference of the DFG International Research Training Group 2057 – Physical Modeling for Virtual Manufacturing (iPMVM 2020)}, pages = {7:1--7:17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-183-2}, ISSN = {2190-6807}, year = {2021}, volume = {89}, editor = {Garth, Christoph and Aurich, Jan C. and Linke, Barbara and M\"{u}ller, Ralf and Ravani, Bahram and Weber, Gunther H. and Kirsch, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.iPMVM.2020.7}, URN = {urn:nbn:de:0030-drops-137562}, doi = {10.4230/OASIcs.iPMVM.2020.7}, annote = {Keywords: drilling, cooling, CFD} }
Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Michael Fuchs, Noela S. Müller, and Henning Sulzbach. Refined Asymptotics for the Number of Leaves of Random Point Quadtrees. In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fuchs_et_al:LIPIcs.AofA.2018.23, author = {Fuchs, Michael and M\"{u}ller, Noela S. and Sulzbach, Henning}, title = {{Refined Asymptotics for the Number of Leaves of Random Point Quadtrees}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-078-1}, ISSN = {1868-8969}, year = {2018}, volume = {110}, editor = {Fill, James Allen and Ward, Mark Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.23}, URN = {urn:nbn:de:0030-drops-89165}, doi = {10.4230/LIPIcs.AofA.2018.23}, annote = {Keywords: Quadtree, number of leaves, phase change, stochastic fixed-point equation, central limit theorem, positivity of variance, contraction method} }
Published in: OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009)
Annabell Berger, Daniel Delling, Andreas Gebhardt, and Matthias Müller-Hannemann. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09). Open Access Series in Informatics (OASIcs), Volume 12, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger_et_al:OASIcs.ATMOS.2009.2148, author = {Berger, Annabell and Delling, Daniel and Gebhardt, Andreas and M\"{u}ller-Hannemann, Matthias}, title = {{Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected}}, booktitle = {9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}, pages = {1--21}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-11-8}, ISSN = {2190-6807}, year = {2009}, volume = {12}, editor = {Clausen, Jens and Di Stefano, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2148}, URN = {urn:nbn:de:0030-drops-21481}, doi = {10.4230/OASIcs.ATMOS.2009.2148}, annote = {Keywords: Timetable information, multi-criteria search, time-dependent networks, arc flags, contraction Timetable information, multi-criteria search, time-dependent networks, arc flags, contraction} }
Published in: Dagstuhl Seminar Proceedings, Volume 9211, Visualization and Monitoring of Network Traffic (2009)
Brian Worden, Claudia Baltes, Inga Scheler, Paul Müller, and Hans Hagen. Accounting system for heterogeneous IP-networks (IPNA) implemented at Kaiserslautern University. In Visualization and Monitoring of Network Traffic. Dagstuhl Seminar Proceedings, Volume 9211, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{worden_et_al:DagSemProc.09211.3, author = {Worden, Brian and Baltes, Claudia and Scheler, Inga and M\"{u}ller, Paul and Hagen, Hans}, title = {{Accounting system for heterogeneous IP-networks (IPNA) implemented at Kaiserslautern University}}, booktitle = {Visualization and Monitoring of Network Traffic}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9211}, editor = {Daniel A. Keim and Aiko Pras and J\"{u}rgen Sch\"{o}nw\"{a}lder and Pak Chung Wong}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09211.3}, URN = {urn:nbn:de:0030-drops-21557}, doi = {10.4230/DagSemProc.09211.3}, annote = {Keywords: Accounting system, IP-network, Communication, informa- tion visualization, online quality control} }
Published in: Dagstuhl Seminar Proceedings, Volume 9051, Knowledge representation for intelligent music processing (2009)
Sebastian Ewert, Meinard Müller, Daniel Müllensiefen, Michael Clausen, and Geraint A. Wiggins. Case Study ``Beatles Songs'' – What can be Learned from Unreliable Music Alignments?. In Knowledge representation for intelligent music processing. Dagstuhl Seminar Proceedings, Volume 9051, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ewert_et_al:DagSemProc.09051.3, author = {Ewert, Sebastian and M\"{u}ller, Meinard and M\"{u}llensiefen, Daniel and Clausen, Michael and Wiggins, Geraint A.}, title = {{Case Study ``Beatles Songs'' – What can be Learned from Unreliable Music Alignments?}}, booktitle = {Knowledge representation for intelligent music processing}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9051}, editor = {Eleanor Selfridge-Field and Frans Wiering and Geraint A. Wiggins}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09051.3}, URN = {urn:nbn:de:0030-drops-19640}, doi = {10.4230/DagSemProc.09051.3}, annote = {Keywords: MIDI, audio, music synchronization, multimodal, music collections, Beatles songs} }
Published in: Dagstuhl Seminar Proceedings, Volume 7281, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007)
Iris van Rooij, Matthew Hamilton, Moritz Müller, and Todd Wareham. Approximating Solution Structure. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings, Volume 7281, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{vanrooij_et_al:DagSemProc.07281.3, author = {van Rooij, Iris and Hamilton, Matthew and M\"{u}ller, Moritz and Wareham, Todd}, title = {{Approximating Solution Structure}}, booktitle = {Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7281}, editor = {Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.3}, URN = {urn:nbn:de:0030-drops-12345}, doi = {10.4230/DagSemProc.07281.3}, annote = {Keywords: Approximation Algorithms, Solution Structure} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Daniel Lehmann, Rudolf Müller, and Tuomas Sandholm. 05011 Abstracts Collection – Computing and Markets. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{lehmann_et_al:DagSemProc.05011.1, author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas}, title = {{05011 Abstracts Collection – Computing and Markets}}, booktitle = {Computing and Markets}, pages = {1--26}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.1}, URN = {urn:nbn:de:0030-drops-2250}, doi = {10.4230/DagSemProc.05011.1}, annote = {Keywords: Algorithms, complexity, game theory, social choice, auctions, equilibrium} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Daniel Lehmann, Rudolf Müller, and Tuomas Sandholm. 05011 Executive Summary – Computing and Markets. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{lehmann_et_al:DagSemProc.05011.2, author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas}, title = {{05011 Executive Summary – Computing and Markets}}, booktitle = {Computing and Markets}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.2}, URN = {urn:nbn:de:0030-drops-2248}, doi = {10.4230/DagSemProc.05011.2}, annote = {Keywords: Algorithms, complexity, game theory, social choice, auctions, equilibrium} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Rudolf Müller, Andres Perea, and Sascha Wolf. A Network Approach to Bayes-Nash Incentive Compatible Mechanisms. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{muller_et_al:DagSemProc.05011.4, author = {M\"{u}ller, Rudolf and Perea, Andres and Wolf, Sascha}, title = {{A Network Approach to Bayes-Nash Incentive Compatible Mechanisms}}, booktitle = {Computing and Markets}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.4}, URN = {urn:nbn:de:0030-drops-2056}, doi = {10.4230/DagSemProc.05011.4}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Hongwei Gui, Rudolf Müller, and Rakesh V. Vohra. Dominant Strategy Mechanisms with Multidimensional Types. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{hongweigui_et_al:DagSemProc.05011.8, author = {Hongwei Gui and M\"{u}ller, Rudolf and Vohra, Rakesh V.}, title = {{Dominant Strategy Mechanisms with Multidimensional Types}}, booktitle = {Computing and Markets}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.8}, URN = {urn:nbn:de:0030-drops-2107}, doi = {10.4230/DagSemProc.05011.8}, annote = {Keywords: Dominant Strategy, Farkas Lemma,} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Daniel Lehmann, Rudolf Müller, Tuomas Sandholm, and Rakesh V. Vohra. Electronic Market Design (Dagstuhl Seminar 02241). Dagstuhl Seminar Report 344, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2002)
@TechReport{lehmann_et_al:DagSemRep.344, author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas and Vohra, Rakesh V.}, title = {{Electronic Market Design (Dagstuhl Seminar 02241)}}, pages = {1--18}, ISSN = {1619-0203}, year = {2002}, type = {Dagstuhl Seminar Report}, number = {344}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.344}, URN = {urn:nbn:de:0030-drops-152250}, doi = {10.4230/DagSemRep.344}, }
Feedback for Dagstuhl Publishing