| Distance from Triviality 2.0: Hybrid Parameterizations
|
2022 |
Agrawal, Akanksha |
| Perfect Matchings with Crossings
|
2022 |
Aichholzer, Oswin |
| Graph Parameters, Implicit Representations and Factorial Properties
|
2022 |
Alecu, Bogdan |
| Computing Longest (Common) Lyndon Subsequences
|
2022 |
Bannai, Hideo |
| Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening
|
2022 |
Idalino, Thais Bardini |
| A New Temporal Interpretation of Cluster Editing
|
2022 |
Bocci, Cristiano |
| An Efficient Algorithm for the Proximity Connected Two Center Problem
|
2022 |
Bhattacharya, Binay |
| The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
|
2022 |
Burjons, Elisabet |
| Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs
|
2022 |
Castonguay, Diane |
| The Parameterized Complexity of s-Club with Triangle and Seed Constraints
|
2022 |
Garvardt, Jaroslav |
| An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
|
2022 |
Inoue, Asei |
| Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota
|
2022 |
Kaczmarek, Joanna |
| Practical Space-Efficient Index for Structural Pattern Matching
|
2022 |
Kim, Sung-Hwan |
| On the Existence of EFX Allocations
|
2022 |
Chaudhury, Bhaskar Ray |
| Approximating Subset Sum Ratio via Subset Sum Computations
|
2022 |
Alonistiotis, Giannis |
| An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars
|
2022 |
Banerijee, Avah |
| Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
|
2022 |
Bekos, Michael A. |
| Space-Efficient B Trees via Load-Balancing
|
2022 |
I, Tomohiro |
| Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
|
2022 |
Mieno, Takuya |
| Linear Time Construction of Indexable Elastic Founder Graphs
|
2022 |
Rizzo, Nicola |
Tag hinzufügen