Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 4 of 470 results
Sort by: relevance publication year

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

JOURNAL ARTICLE published November 1983 in SIAM Journal on Computing

Authors: Nimrod Megiddo

Linear Time Algorithms and NP-Complete Problems

JOURNAL ARTICLE published June 1994 in SIAM Journal on Computing

Authors: Etienne Grandjean

Algorithmic Aspects of Vertex Elimination on Graphs

JOURNAL ARTICLE published June 1976 in SIAM Journal on Computing

Authors: Donald J. Rose | R. Endre Tarjan | George S. Lueker

Parallel Solution of Certain Toeplitz Linear Systems

JOURNAL ARTICLE published May 1984 in SIAM Journal on Computing

Authors: Dario Bini

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing

JOURNAL ARTICLE published January 2016 in SIAM Journal on Computing

Research funded by Swiss National Science Foundation (200021-165977,200020-162884) | National Science Foundation (DMS-1500153,DMS 1352121)

Authors: Jacob Fox | János Pach | Andrew Suk

Almost all hypergraphs without Fano planes are bipartite

PROCEEDINGS ARTICLE published 4 January 2009 in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Authors: Yury Person | Mathias Schacht

A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs

JOURNAL ARTICLE published November 1979 in SIAM Journal on Computing

Authors: Adi Shamir

A New Approach to the Orientation of Random Hypergraphs

PROCEEDINGS ARTICLE published 17 January 2012 in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms

Authors: M. Lelarge

Amortized Analysis of Algorithms for Set Union with Backtracking

JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing

Authors: Jeffery Westbrook | Robert E. Tarjan

Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs

PROCEEDINGS ARTICLE published January 2017 in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

Authors: Sam Chiu-wai Wong

Finding Perfect Matchings in Dense Hypergraphs

BOOK CHAPTER published January 2020 in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Authors: Jie Han | Peter Keevash

Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs

JOURNAL ARTICLE published January 2015 in SIAM Journal on Computing

Authors: Martin Grohe | Dániel Marx

Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees

JOURNAL ARTICLE published June 1993 in SIAM Journal on Computing

Authors: Ming-Yang Kao | Gregory E. Shannon

An Incremental Linear-Time Algorithm for Recognizing Interval Graphs

JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing

Authors: Norbert Korte | Rolf H. Möhring

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

JOURNAL ARTICLE published January 2018 in SIAM Journal on Discrete Mathematics

Research funded by H2020 European Research Council (306992) | Seventh Framework Programme (FP7/2007-2013)

Authors: Pradeesha Ashok | Aditi Dudeja | Sudeshna Kolay | Saket Saurabh

The Multiple-orientability Thresholds for Random Hypergraphs

PROCEEDINGS ARTICLE published 23 January 2011 in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms

Authors: Nikolaos Fountoulakis | Megha Khosla | Konstantinos Panagiotou

A Faster Isomorphism Test for Graphs of Small Degree

JOURNAL ARTICLE published December 2023 in SIAM Journal on Computing

Authors: Martin Grohe | Daniel Neuen | Pascal Schweitzer

Improved Algorithms for Bipartite Network Flow

JOURNAL ARTICLE published October 1994 in SIAM Journal on Computing

Authors: Ravindra K. Ahuja | James B. Orlin | Clifford Stein | Robert E. Tarjan

A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs

JOURNAL ARTICLE published April 1994 in SIAM Journal on Computing

Authors: Michael Kaufmann | Kurt Mehlhorn

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

JOURNAL ARTICLE published January 1999 in SIAM Journal on Computing

Authors: Haim Kaplan | Ron Shamir | Robert E. Tarjan