| 601 |
Using a geometric lens to find k disjoint shortest paths
Matthias Bentert, André Nichterlein, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
18 |
5 years ago |
| 602 |
A Bunched Logic for Conditional Independence
Jialu Bao, Simon Docherty, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
18 |
5 years ago |
| 603 |
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
|
🔮
The Ethereal
|
cs.CC
|
18 |
5 years ago |
| 604 |
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
Jonas Kastberg Hinrichsen, Jesper Bengtson, Robbert Krebbers
|
🔮
The Ethereal
|
cs.LO
|
18 |
5 years ago |
| 605 |
Training Neural Networks is NP-Hard in Fixed Dimension
Vincent Froese, Christoph Hertrich
|
🔮
The Ethereal
|
cs.CC
|
18 |
3 years ago |
| 606 |
Mutual visibility in hypercube-like graphs
Serafino Cicerone, Alessia Di Fonso, ... (+3 more)
|
🔮
The Ethereal
|
math.CO
|
18 |
2 years ago |
| 607 |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
Clément Dallard, Matjaž Krnc, ... (+5 more)
|
🔮
The Ethereal
|
math.CO
|
18 |
2 years ago |
| 608 |
The Discrete Cosine Transform over Prime Finite Fields
M. M. Campello de Souza, H. M. de Oliveira, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
17 |
11 years ago |
| 609 |
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, ... (+3 more)
|
🔮
The Ethereal
|
cs.DM
|
17 |
11 years ago |
| 610 |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL
Christoph Benzmüller, Maximilian Claus, Nik Sultana
|
🔮
The Ethereal
|
cs.LO
|
17 |
10 years ago |
| 611 |
Extremal Distances for Subtree Transfer Operations in Binary Trees
Ross Atkins, Colin McDiarmid
|
🔮
The Ethereal
|
math.CO
|
17 |
10 years ago |
| 612 |
Hardness of RNA Folding Problem with Four Symbols
Yi-Jun Chang
|
🔮
The Ethereal
|
cs.CC
|
17 |
10 years ago |
| 613 |
Parameterizing edge modification problems above lower bounds
René van Bevern, Vincent Froese, Christian Komusiewicz
|
🔮
The Ethereal
|
cs.DM
|
17 |
10 years ago |
| 614 |
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
A. Molinari, A. Montanari, A. Peron
|
🔮
The Ethereal
|
cs.LO
|
17 |
10 years ago |
| 615 |
Quasi-4-Connected Components
Martin Grohe
|
🔮
The Ethereal
|
cs.DM
|
17 |
10 years ago |
| 616 |
On the limitations of analysing worst-case dynamic energy of processing
Jeremy Morse, Steve Kerrison, Kerstin Eder
|
🔮
The Ethereal
|
cs.CC
|
17 |
10 years ago |
| 617 |
Structural Synthesis for GXW Specifications
Chih-Hong Cheng, Yassine Hamza, Harald Ruess
|
🔮
The Ethereal
|
cs.LO
|
17 |
10 years ago |
| 618 |
A Timed Process Algebra for Wireless Networks
Emile Bres, Rob van Glabbeek, Peter Höfner
|
🔮
The Ethereal
|
cs.LO
|
17 |
10 years ago |
| 619 |
Approximating Multicut and the Demand Graph
Chandra Chekuri, Vivek Madan
|
🔮
The Ethereal
|
cs.DM
|
17 |
9 years ago |
| 620 |
Combinatorial Repairability for Threshold Schemes
Douglas R. Stinson, Ruizhong Wei
|
🔮
The Ethereal
|
math.CO
|
17 |
9 years ago |
| 621 |
A unifying framework for fast randomization of ecological networks with fixed (node) degrees
Corrie Jacobien Carstens, Annabell Berger, Giovanni Strona
|
🔮
The Ethereal
|
math.CO
|
17 |
9 years ago |
| 622 |
On Probabilistic Checking in Perfect Zero Knowledge
Eli Ben-Sasson, Alessandro Chiesa, ... (+4 more)
|
🔮
The Ethereal
|
cs.CC
|
17 |
9 years ago |
| 623 |
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols
Max Kanovich, Tajana Ban Kirigin, ... (+3 more)
|
🔮
The Ethereal
|
cs.LO
|
17 |
9 years ago |
| 624 |
Resource-Efficient Common Randomness and Secret-Key Schemes
Badih Ghazi, T. S. Jayram
|
🔮
The Ethereal
|
cs.CC
|
17 |
8 years ago |
| 625 |
Diffusion and consensus on weakly connected directed graphs
J. J. P. Veerman, E. Kummel
|
🔮
The Ethereal
|
math.CO
|
17 |
7 years ago |
| 626 |
Subexponential algorithms for variants of homomorphism problem in string graphs
Karolina Okrasa, Paweł Rzążewski
|
🔮
The Ethereal
|
cs.CC
|
17 |
7 years ago |
| 627 |
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Antoine Amarilli, Michael Benedikt
|
🔮
The Ethereal
|
cs.LO
|
17 |
7 years ago |
| 628 |
Approximation Algorithm for the Partial Set Multi-Cover Problem
Yishuo Shi, Yingli Ran, ... (+4 more)
|
🔮
The Ethereal
|
cs.DM
|
17 |
7 years ago |
| 629 |
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
Ferenc Bencs, Ewan Davies, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
17 |
7 years ago |
| 630 |
Deterministic Approximation of Random Walks in Small Space
Jack Murtagh, Omer Reingold, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
17 |
7 years ago |
| 631 |
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
|
🔮
The Ethereal
|
cs.CC
|
17 |
7 years ago |
| 632 |
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
Marc Roth, Philip Wellnitz
|
🔮
The Ethereal
|
cs.CC
|
17 |
7 years ago |
| 633 |
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Michele Conforti, Samuel Fiorin, ... (+3 more)
|
🔮
The Ethereal
|
cs.DM
|
17 |
6 years ago |
| 634 |
Universal Communication, Universal Graphs, and Graph Labeling
Nathaniel Harms
|
🔮
The Ethereal
|
cs.CC
|
17 |
6 years ago |
| 635 |
Deep Weisfeiler Leman
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
|
🔮
The Ethereal
|
cs.LO
|
17 |
6 years ago |
| 636 |
On the list recoverability of randomly punctured codes
Ben Lund, Aditya Potukuchi
|
🔮
The Ethereal
|
math.CO
|
17 |
6 years ago |
| 637 |
Type safety of rewrite rules in dependent types
Frédéric Blanqui
|
🔮
The Ethereal
|
cs.LO
|
17 |
5 years ago |
| 638 |
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions
Umang Mathur, Andreas Pavlogiannis, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
17 |
4 years ago |
| 639 |
Twin-width and types
Jakub Gajarský, Michał Pilipczuk, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
17 |
4 years ago |
| 640 |
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Joel D. Day, Maria Kosche, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
17 |
4 years ago |
| 641 |
Cohomology in Constraint Satisfaction and Structure Isomorphism
Adam Ó Conghaile
|
🔮
The Ethereal
|
cs.LO
|
17 |
4 years ago |
| 642 |
Polynomial-Time Pseudodeterministic Construction of Primes
Lijie Chen, Zhenjian Lu, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
17 |
3 years ago |
| 643 |
On the Role of Shared Randomness in Simultaneous Communication
Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito
|
🔮
The Ethereal
|
cs.CC
|
16 |
10 years ago |
| 644 |
Advice Complexity of the Online Induced Subgraph Problem
Dennis Komm, Rastislav Královič, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
16 |
10 years ago |
| 645 |
On the effect of randomness on planted 3-coloring models
Roee David, Uriel Feige
|
🔮
The Ethereal
|
cs.CC
|
16 |
10 years ago |
| 646 |
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
Robert Bredereck, Christian Komusiewicz, ... (+4 more)
|
🔮
The Ethereal
|
cs.CC
|
16 |
10 years ago |
| 647 |
Founded Semantics and Constraint Semantics of Logic Rules
Yanhong A. Liu, Scott D. Stoller
|
🔮
The Ethereal
|
cs.LO
|
16 |
10 years ago |
| 648 |
$χ$-bounds, operations and chords
Lan Anh Pham, Nicolas Trotignon
|
🔮
The Ethereal
|
cs.DM
|
16 |
9 years ago |
| 649 |
Dichotomy for Real Holant$^c$ Problems
Jin-Yi Cai, Pinyan Lu, Mingji Xia
|
🔮
The Ethereal
|
cs.CC
|
16 |
9 years ago |
| 650 |
On the number of inequivalent Gabidulin codes
Kai-Uwe Schmidt, Yue Zhou
|
🔮
The Ethereal
|
math.CO
|
16 |
9 years ago |