| Two-Sided Matching Markets with Strongly Correlated Preferences
|
2021 |
Gimbert, Hugo |
| From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
|
2021 |
Löser,, Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander |
| A. Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider
|
2021 |
Bender, Max |
| First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words
|
2021 |
Adsul, Bharat |
| The Satisfiability Problem for a Quantitative Fragment of PCTL
|
2021 |
Chodil, Miroslav |
| Minimum Consistent Subset Problem for Trees
|
2021 |
Dey, Sanjana |
| Computational Complexity of Computing a Quasi-Proper Equilibrium
|
2021 |
Hansen, Kristoffer Arnsfelt |
| On Minimizing Regular Expressions Without Kleene Star
|
2021 |
Gruber, Hermann |
| The Possible Winner Problem with Uncertain Weights Revisited.
|
2021 |
Neveling, Marc |
| Concentration of the Collision Estimator
|
2021 |
Skorski, Maciej |
| Beyond the BEST Theorem: Fast Assessment of Eulerian Trails
|
2021 |
Conte, Alessio |
| Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
|
2021 |
Eppstein, David |
| On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters
|
2021 |
Hogemo, Svein |
| Fast Algorithms for the Rooted Triplet Distance Between Caterpillars
|
2021 |
Jansson, Jesper |
| Propositional Gossip Protocols
|
2021 |
Livesey, Joseph |
| Complexity of Word Problems for HNN-Extensions
|
2021 |
Lohrey, Markus |
| Valency-Based Consensus Under Message Adversaries Without Limit-Closure
|
2021 |
Winkler, Kyrill |
| Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types
|
2021 |
Yoshida, Nobuko |
| The Complexity of Bicriteria Tree-Depth
|
2021 |
Borowiecki, Piotr |
| TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs
|
2021 |
Bousquet, Nicolas |
Tag hinzufügen