Facet browsing currently unavailable
Page 4 of 469 results
Sort by: relevance publication year
Algorithmic Aspects of Vertex Elimination on Graphs JOURNAL ARTICLE published June 1976 in SIAM Journal on Computing |
Parallel Solution of Certain Toeplitz Linear Systems JOURNAL ARTICLE published May 1984 in SIAM Journal on Computing |
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) |
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 |
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 |
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs JOURNAL ARTICLE published November 1979 in SIAM Journal on Computing |
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 |
Amortized Analysis of Algorithms for Set Union with Backtracking JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing |
Finding Perfect Matchings in Dense Hypergraphs BOOK CHAPTER published January 2020 in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees JOURNAL ARTICLE published June 1993 in SIAM Journal on Computing |
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs PROCEEDINGS ARTICLE published October 2015 in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms |
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs JOURNAL ARTICLE published January 2015 in SIAM Journal on Computing |
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing |
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) |
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 |
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs JOURNAL ARTICLE published April 1994 in SIAM Journal on Computing |
A Faster Isomorphism Test for Graphs of Small Degree JOURNAL ARTICLE published December 2023 in SIAM Journal on Computing |
Improved Algorithms for Bipartite Network Flow JOURNAL ARTICLE published October 1994 in SIAM Journal on Computing |
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs JOURNAL ARTICLE published January 1999 in SIAM Journal on Computing |
Sub-Constant Error Low Degree Test of Almost-Linear Size JOURNAL ARTICLE published January 2008 in SIAM Journal on Computing |