| l-Extendability of Independent Sets
|
2022 |
Bergé, Pierre |
| List Covering of Regular Multigraphs
|
2022 |
Bok, Jan |
| A Shift Gray Code for Fixed-Content Lukasiewicz Words
|
2022 |
Lapey, Paul W. |
| Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms
|
2022 |
Lingg, Jonas |
| Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
|
2022 |
Papadopoulos, Charis |
| Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks
|
2022 |
Nguyen, Thi Huyen Chau |
| 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 |
| 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 |
Tag hinzufügen