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

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

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

Authors: Venkatesan Guruswami | Euiwoong Lee

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

Strong Transversals in Hypergraphs and Double Total Domination in Graphs

JOURNAL ARTICLE published January 2010 in SIAM Journal on Discrete Mathematics

Authors: Michael A. Henning | Anders Yeo

3-Uniform Hypergraphs and Linear Cycles

JOURNAL ARTICLE published January 2018 in SIAM Journal on Discrete Mathematics

Research funded by National Research, Development and Innovation Office (K116769)

Authors: Beka Ergemlidze | Ervin Györi | Abhishek Methuku

Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

JOURNAL ARTICLE published January 1998 in SIAM Journal on Computing

Authors: Wen-Lian Hsu | Tze-Heng Ma

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs

JOURNAL ARTICLE published May 2021 in Graphs and Combinatorics

Authors: Michael A. Henning | Anders Yeo

Multipass greedy coloring of simple uniform hypergraphs

JOURNAL ARTICLE published January 2016 in Random Structures & Algorithms

Research funded by Polish National Science Center (2011/01/D/ST1/04412)

Authors: Jakub Kozik

Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs

JOURNAL ARTICLE published January 2018 in SIAM Journal on Applied Mathematics

Authors: Jessica Bosch | Steffen Klamt | Martin Stoll

Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

PROCEEDINGS ARTICLE published November 2019 in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)

Authors: David G. Harris

Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time

JOURNAL ARTICLE published December 1992 in SIAM Journal on Computing

Authors: Brandon Dixon | Monika Rauch | Robert E. Tarjan

An effective multilevel algorithm for bisecting graphs and hypergraphs

JOURNAL ARTICLE published June 2004 in IEEE Transactions on Computers

Authors: Y.G. Saab

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

An Efficient Test for Circular-Arc Graphs

JOURNAL ARTICLE published February 1980 in SIAM Journal on Computing

Authors: Alan Tucker

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

JOURNAL ARTICLE published January 2013 in SIAM Journal on Discrete Mathematics

Authors: Panagiotis Cheilaris | Balázs Keszegh | Dömötör Pálvölgyi

Problems and Results on Graphs and Hypergraphs: Similarities and Differences

BOOK CHAPTER published 1990 in Algorithms and Combinatorics

Authors: Paul Erdös

Edge intersection graphs of linear 3-uniform hypergraphs

JOURNAL ARTICLE published June 2009 in Discrete Mathematics

Authors: P.V. Skums | S.V. Suzdal | R.I. Tyshkevich

Three Partition Refinement Algorithms

JOURNAL ARTICLE published December 1987 in SIAM Journal on Computing

Authors: Robert Paige | Robert E. Tarjan

An $O(nlog log n)$-Time Algorithm for Triangulating a Simple Polygon

JOURNAL ARTICLE published February 1988 in SIAM Journal on Computing

Authors: Robert E. Tarjan | Christopher J. Van Wyk

Limitations on Explicit Constructions of Expanding Graphs

JOURNAL ARTICLE published February 1984 in SIAM Journal on Computing

Authors: Maria Klawe