| Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
|
2022 |
Balzotti, Lorenzo |
| Output Sensitive Fault Tolerant Maximum Matching
|
2022 |
Banerjee, Niranka |
| The Fast Algorithm for Online k-server Problem on Trees
|
2022 |
Khadiev, Kamil |
| Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring
|
2022 |
Abidha, V. P |
| Parameterized Algorithms for Finding Highly Connected Solution
|
2022 |
Abhinav, Ankit |
| Parameterized Complexity of List Coloring and Max Coloring
|
2022 |
Aryanfard, Bardiya |
| Eternal Vertex Cover on Bipartite Graphs
|
2022 |
Babu, Jasine |
| Partial Vertex Cover on Graphs of Bounded Degeneracy
|
2022 |
Panolan, Fahad |
| Abelian Repetition Threshold Revisited
|
2022 |
Petrova, Elena A. |
| Characterizing Level One in Group-Based Concatenation Hierarchies
|
2022 |
Place, Thomas |
| Quotient Structures and Groups Computable in Polynomial Time
|
2022 |
Alaev, Pavel |
| Bounds for Synchronizing Markov Decision Processes
|
2022 |
Doyen, Laurent |
| Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs
|
2022 |
Golovach, Petr A. |
| Discrete Versions of the KKM Lemma and Their PPAD-Completeness
|
2022 |
Grishutin, Alexander |
| Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields
|
2022 |
Kostolányi, Peter |
| Heterogeneous Multi-commodity Network Flows over Time
|
2022 |
Li, Yifen |
| Lossy Kernelization of Same-Size Clustering
|
2022 |
Bandyapadhyay, Sayan |
| New Bounds for the Flock-of-Birds Problem
|
2022 |
Kozachinskiy, Alexander |
| On the Determinization of Event-Clock Input-Driven Pushdown Automata
|
2022 |
Ogawa, Mizuhito |
| The GKK Algorithm is the Fastest over Simple Mean-Payott Games
|
2022 |
Ohlmann, Pierre |
Tag hinzufügen