Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Shiri Chechik
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs
Related publications
Contractible Subgraphs in 3-Connected Graphs
Journal of Combinatorial Theory. Series B
Combinatorics
Computational Theory
Discrete Mathematics
Theoretical Computer Science
Mathematics
Computing Sparse Permanents Faster
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Splitting Lemma for 2-Connected Graphs
ISRN Discrete Mathematics
Generating Connected and 2-Edge Connected Graphs
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
Spaghetti Labeling: Directed Acyclic Graphs for Block-Based Connected Components Labeling
IEEE Transactions on Image Processing
Computer Graphics
Computer-Aided Design
Software
On 2-Connected Spanning Subgraphs With Low Maximum Degree
Journal of Combinatorial Theory. Series B
Combinatorics
Computational Theory
Discrete Mathematics
Theoretical Computer Science
Mathematics
