{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:00:24Z","timestamp":1757624424030,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","funder":[{"name":"German Federal Ministry of Education and Research (BMBF)","award":["QR.X (16KISQ023)"],"award-info":[{"award-number":["QR.X (16KISQ023)"]}]},{"name":"Deutsche Forschungsgemeinschaft","award":["RO-1202\/21-2 (438204498)","ML4Q EXC 2004\/1-390534769"],"award-info":[{"award-number":["RO-1202\/21-2 (438204498)","ML4Q EXC 2004\/1-390534769"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3731545.3744148","type":"proceedings-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:46:16Z","timestamp":1757421976000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Matching in Multipartite Quantum Routers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4661-2267","authenticated-orcid":false,"given":"Dagmar","family":"Bru\u00df","sequence":"first","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5757-005X","authenticated-orcid":false,"given":"Luis","family":"Gindorf","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9567-0921","authenticated-orcid":false,"given":"Julia","family":"Kunzelmann","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8377-3524","authenticated-orcid":false,"given":"Christian","family":"Lau\u00dfmann","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0589-3616","authenticated-orcid":false,"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.012301"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.012303"},{"key":"e_1_3_2_1_3_1","volume-title":"Orlin","author":"Ahuja Ravindra K.","year":"1993","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Hoboken, NJ, USA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.012609"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Press","author":"Charles","unstructured":"Charles H. Bennett and Gilles Brassard. 1984. Quantum Cryptography: Public Key Distribution and Coin Tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Press, New York, NY, USA, 175\u2013179."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.43.9.842"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.5932"},{"key":"e_1_3_2_1_8_1","volume-title":"Quantum Cryptography: A Survey. Comput. Surveys 39, 2","author":"Bru\u00df Dagmar","year":"2007","unstructured":"Dagmar Bru\u00df, G\u00e1bor Erd\u00e9lyi, Tim Meyer, Tobias Riege, and J\u00f6rg Rothe. 2007. Quantum Cryptography: A Survey. Comput. Surveys 39, 2 (2007), article 6, 27 pp."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"060502","DOI":"10.1103\/PhysRevLett.98.060502","article-title":"Multiplexed Memory-Insensitive Quantum Repeaters","volume":"98","author":"Collins Odell A.","year":"2007","unstructured":"Odell A. Collins, Stewart David Jenkins, Alex Kuzmich, and T. A. Brian Kennedy. 2007. Multiplexed Memory-Insensitive Quantum Repeaters. Physical Review Letters 98 (2007), 060502. Issue 6.","journal-title":"Physical Review Letters"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 3rd ACM Symposium on Theory of Computing. ACM Press","author":"Cook Stephen A.","year":"1971","unstructured":"Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing. ACM Press, New York, NY, USA, 151\u2013158."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-021-00647-8"},{"key":"e_1_3_2_1_12_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R. Fellows. 2013. Parameterized Complexity (2nd ed.). Springer-Verlag, Heidelberg and Berlin, Germany."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.59.169"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/18\/5\/053036"},{"key":"e_1_3_2_1_15_1","volume-title":"Johnson","author":"Garey Michael","year":"1979","unstructured":"Michael Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.145"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aaec34"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_19_1","volume-title":"Complexity of Computer Computations, Raymond E","author":"Karp Richard M.","unstructured":"Richard M. Karp. 1972. Reducibility among Combinatorial Problems. In Complexity of Computer Computations, Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger (Eds.). Plenum Press, New York, NY, USA, 85\u2013103."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.110.032617"},{"key":"e_1_3_2_1_21_1","first-page":"115","article-title":"Universal Sorting Problems","volume":"9","author":"Levin Leonid","year":"1973","unstructured":"Leonid Levin. 1973. Universal Sorting Problems. Problemy Peredaci Informacii 9 (1973), 115\u2013116. In Russian. English translation in Problems of Information Transmission, 9:265\u2013266, 1973.","journal-title":"Problemy Peredaci Informacii"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41566-019-0468-5"},{"key":"e_1_3_2_1_23_1","volume-title":"Plummer","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"2009","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Michael D. Plummer. 2009. Matching Theory. Vol. 367. AMS Chelsea Publishing, New York, NY, USA."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"2000025","DOI":"10.1002\/qute.202000025","article-title":"Quantum Conference Key Agreement","volume":"3","author":"Murta Gl\u00e1ucia","year":"2020","unstructured":"Gl\u00e1ucia Murta, Federico Grasselli, Hermann Kampermann, and Dagmar Bru\u00df. 2020. Quantum Conference Key Agreement: A Review. Advanced Quantum Technologies 3, 11 (2020), 2000025.","journal-title":"A Review. Advanced Quantum Technologies"},{"key":"e_1_3_2_1_25_1","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier Rolf","unstructured":"Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford, UK."},{"key":"e_1_3_2_1_26_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2010","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_27_1","volume-title":"Computational Complexity","author":"Papadimitriou Christos","unstructured":"Christos Papadimitriou. 1995. Computational Complexity (second ed.). Addison-Wesley, Reading, MA, USA."},{"key":"e_1_3_2_1_28_1","volume-title":"Complexity Theory and Cryptology. An Introduction to Cryptocomplexity","author":"Rothe J\u00f6rg","unstructured":"J\u00f6rg Rothe. 2005. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. Springer-Verlag, Heidelberg and Berlin, Germany."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.2307\/2307185","article-title":"Two New Inequalities","volume":"59","author":"Ruderman H. D.","year":"1952","unstructured":"H. D. Ruderman. 1952. Two New Inequalities. The American Mathematical Monthly 59, 1 (1952), 29\u201332. https:\/\/www.jstor.org\/stable\/2307185","journal-title":"The American Mathematical Monthly"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.81.1301"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.441"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/tqe.2021.3058058"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","first-page":"7067","DOI":"10.1088\/0305-4470\/34\/35\/331","article-title":"Constructing Qubits in Physical Systems","volume":"34","author":"Viola Lorenza","year":"2001","unstructured":"Lorenza Viola, Emanuel Knill, and Raymond Laflamme. 2001. Constructing Qubits in Physical Systems. Journal of Physics A: Mathematical and General 34, 35 (2001), 7067\u20137079.","journal-title":"Journal of Physics A: Mathematical and General"}],"event":{"name":"HPDC '25: 34th International Symposium on High-Performance Parallel and Distributed Computing","location":"University of Notre Dame Conference Facilities Notre Dame IN USA","acronym":"HPDC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731545.3744148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:49:00Z","timestamp":1757422140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731545.3744148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":34,"alternative-id":["10.1145\/3731545.3744148","10.1145\/3731545"],"URL":"https:\/\/doi.org\/10.1145\/3731545.3744148","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}