Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
|
2021 |
Yamakami, Tomoyukt |
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata
|
2021 |
Hoffmann, Stefan |
Minimum Color Spanning Circle in Imprecise Setup
|
2021 |
Acharyya, Ankush |
Reconfiguring Directed Trees in a Digraph
|
2021 |
Ito, Takehiro |
Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract)
|
2021 |
Gupta, Sambhav |
Finding Cheapest Deadline Paths
|
2021 |
Ding, Wei |
Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance
|
2021 |
Duan, Longteng |
Two Standard Decks of Playing Cards Are Sufficient for a ZKP for Sudoku
|
2021 |
Ruangwises, Suthee |
On the Approximation Hardness of Geodetic Set and Its Variants
|
2021 |
Davot, Tom |
A Further Improvement on Approximating TTP-2
|
2021 |
Zhao, Jingyang |
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs
|
2021 |
Kobayashi, Yuki |
Colouring Graphs with No Induced Six-Vertex Path or Diamond
|
2021 |
Goedgebeur, Jan |
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)
|
2021 |
Huang, Sen |
Computational Complexity of Jumping Block Puzzles
|
2021 |
Kanzaki, Masaaki |
Spy Game: FPT-Algorithm and Results on Graph Products
|
2021 |
Costa, Eurinardo Rodrigues |
An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
|
2021 |
Lin, Chun |
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
|
2021 |
Pyne, Edward |
General Max-Min Fair Allocation
|
2021 |
Ko, Sheng-Yen |
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
|
2021 |
Cameron, Ben |
Hardness and Approximation Results of Roman {3}-Domination in Graphs
|
2021 |
Goyal, Pooja |