|
41 |
Scalable Auction Algorithms for Bipartite Maximum Matching Problems
Liu, Quanquan C.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
42 |
Analytical Review of Map Matching Algorithms: Analyzing the Performance and Efficiency Using Road Dataset of the Indian Subcontinent
Enthalten in Archives of computational methods in engineering 11.7.2023: 1-20
|
|
|
|
43 |
Winner Determination Algorithms for Graph Games with Matching Structures
Enthalten in Algorithmica 8.6.2023: 1-17
|
|
|
|
44 |
An analysis of one-to-one matching algorithms for entity resolution
Enthalten in The VLDB journal 18.4.2023: 1-32
|
|
|
|
45 |
Approximate Circular Pattern Matching
Charalampopoulos, Panagiotis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
46 |
Dynamic Matching Algorithms Under Vertex Updates
Le, Hung. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
47 |
Finding Matching Cuts in H-Free Graphs
Lucke, Felicia. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
48 |
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
Feldman, Moran. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
49 |
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants
Asahiro, Yuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
50 |
Prophet Matching in the Probe-Commit Model
Borodin, Allan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
Administration
