Search results for "68R10"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
50	Mao-cheng Cai, Xiaotie Deng, Wenan Zang	A Min-Max Theorem on Feedback Vertex Sets.	IPCO	1999	DBLP DOI BibTeX RDF	bipartite tournament, totally dual integrality, min-max relation, AMS subject classification. 68Q25, approximation algorithm, 68R10, feedback vertex set
30	Petr Hlinený, Gelasio Salazar	On the Crossing Number of Almost Planar Graphs.	GD	2006	DBLP DOI BibTeX RDF	crossing-critical graphs, planarization, crossing number, crossing minimization
20	Rachid Hadid, Mehmet Hakan Karaata	Stabilizing maximum matching in bipartite networks.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68W15, 68R10, 05C85
20	Stefan Felsner, Sarah Kappes	Orthogonal Surfaces and Their CP-Orders.	Order	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C62, 52B05, 68R10, 06A07
20	Alexander Healy	Randomness-Efficient Sampling within NC1.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	68Q15, 68R10, Subject classification. 68Q10
20	Erik D. Demaine, MohammadTaghi Hajiaghayi	Linearity of grid minors in treewidth with applications through bidimensionality.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C83, 68R10, 05C85
20	Fumei Lam, Alantha Newman	Traveling salesman path problems.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 90C27, 68R10, 90C05
20	Béla Csaba, András Pluhár	A randomized algorithm for the on-line weighted bipartite matching problem.	J. Sched.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68R10, 68W40, 68W25
20	Tristan M. Behrens, Jürgen Dix	Model checking multi-agent systems with logic based Petri nets.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B70, 68R10, 68T27
20	Lap Chi Lau	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
20	Mikkel Thorup	Fully-Dynamic Min-Cut.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
20	Irène Charon, Olivier Hudry	A survey on the linear ordering problem for weighted or unweighted tournaments.	4OR	2007	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07
20	Yu Xiong, Jun Ma 0017, Hao Shen	On optimal codes with w-identifiable parent property.	Des. Codes Cryptogr.	2007	DBLP DOI BibTeX RDF	AMS Classification 68R10, 90C27, 90C47
20	Harold N. Gabow	On the Linfinity-norm of extreme points for crossing supermodular directed network LPs.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68W25, 68R10, 90C05, 05C40, 90B10, 05C20
20	Petr Hlinený, Gelasio Salazar	Approximating the Crossing Number of Toroidal Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF	2000 Math Subject Classification 05C10, 05C62, 68R10
20	Seth Pettie	An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
20	Alexander Gamburd, Igor Pak	Expansion Of Product Replacement Graphs.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C90, 20F99, 68R10
20	Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta	Network Design Via Iterative Rounding Of Setpair Relaxations.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10
20	Dirk Müller 0003	On the complexity of the planar directed edge-disjoint paths problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 68Q17, 68R10, 90C35
20	Anupam Gupta 0001, Ilan Newman, Yuri Rabinovich, Alistair Sinclair	Cuts, Trees and l1-Embeddings of Graphs.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C12, 90C27, 68R10, 05C85
20	Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov	On the Value of a Random Minimum Weight Steiner Tree.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C80, 68R10, 60C05
20	Amnon Ta-Shma	Almost Optimal Dispersers.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q01, 68R10
20	Pavel Pudlák	Cycles of Nonzero Elements in Low Rank Matrices.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C99, 15A99, 68R10
20	Christian Houdré	Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C99, 60J10, 68R10
20	Horst Bunke, Simon Günter	Weighted Mean of a Pair of Graphs.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05c99, 68R10, 68T10
20	Sanjeev Khanna, Nathan Linial, Shmuel Safra	On the Hardness of Approximating the Chromatic Number.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q17, 68Q25, 68R10
20	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy	Efficient Testing of Large Graphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68R10, 05C35, 05C85
20	Horst Bunke, Xiaoyi Jiang 0001, Abraham Kandel	On the Minimum Common Supergraph of Two Graphs.	Computing	2000	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C60, 05C85 68R10
20	Oded Goldreich 0001, Dana Ron	A Sublinear Bipartiteness Tester for Bounded Degree Graphs.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R10
20	Tomás Feder, Pavol Hell, Jing Huang 0007	List Homomorphisms and Circular Arc Graphs.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75
20	Clemens Heuberger	Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 11A63, 05C12, 68R10
20	Yossi Azar, Rajeev Motwani 0001, Joseph Naor	Approximating Probability Distributions Using Small Sample Spaces.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 60C05, 68Q22, 94C12, 68Q25, 68R10, 60E15
20	Hajo Broersma, Elias Dahlhaus, Ton Kloks	Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.	WG	1997	DBLP DOI BibTeX RDF	MSC 68R10