Search results for "05C85"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Enrico Malaguti	The Vertex Coloring Problem and its generalizations.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 05C15, 05C85
20	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10
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	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	Cédric Bentz	Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification 05C85, 90C27, 68Q17
20	Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries	On the use of graphs in discrete tomography.	4OR	2008	DBLP DOI BibTeX RDF	MSC classification (2000) 05C15, 90-01, 05C85, 52C99
20	Constanza Riera, Stéphane Jacob, Matthew Geoffrey Parker	From graph states to two-graph states.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	AMS Classifications 81Q08, 81Q10, 05C62, 05C85, 06E30
20	Stefan Porschen	On variable-weighted exact satisfiability problems.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85
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	Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki	Total Colorings Of Degenerate Graphs.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05C85, 90C39
20	Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta	Approximate min-max relations for odd cycles in planar graphs.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 90C27, 05C85, 68W25
20	Balázs Szegedy, Christian Szegedy	Symplectic Spaces And Ear-Decomposition Of Matroids.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C70, 05C85, 05C50
20	Linda S. Moonen	Algorithms for some graph theoretical optimization problems.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 05C85
20	Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter	On Balanced Graphs.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C50, 05C17, 05C85
20	Joseph Cheriyan, Howard J. Karloff, Yuval Rabani	Approximating Directed Multicuts.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25
20	Guojun Li, Ying Xu 0001, Chuanping Chen, Zhenhong Liu	On Connected [g, f +1]-Factors in Graphs.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C85
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	Martin Grohe	Local Tree-Width, Excluded Minors, and Approximation Algorithms.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C85, 68W25
20	Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger	More About Subcolorings.	Computing	2002	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C15, 05C17, 05C85
20	Penny E. Haxell, Vojtech Rödl	Integer and Fractional Packings in Dense Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70, 05C85
20	Tamás Fleiner	Note - Uncrossing a Family of Set-Pairs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C85, 05A05
20	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Kr-Packing Problem.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C70, 68Q20, 05C85
20	Romeo Rizzi	NOTE - On Minimizing Symmetric Set Functions.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C85
20	Kathie Cameron	A Min-Max Relation for Monotone Path Systems in Simple Regions.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 52A37, 05C85, 05C70, 05C38
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	Sabine Le Borne	Ordering Techniques for Two- and Three-Dimensional Convection-Dominated Elliptic Boundary Value Problems.	Computing	2000	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C20, 65N55, 05C85, 05C38
20	Sergei Evdokimov 0001, Ilia N. Ponomarenko	Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C60, 05C85, 05B30
20	Yefim Dinitz, Naveen Garg 0001, Michel X. Goemans	On the Single-Source Unsplittable Flow Problem.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90B10, 05C85, 90C35, 05C38
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	Pranay Chaudhuri	An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C85, 68Q22, 68Q25, 68Q10
20	André Bouchet, William H. Cunningham, James F. Geelen	Principally Unimodular Skew-Symmetric Matrices.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C50, 05C85, 05B35
20	Michel X. Goemans, David P. Williamson	Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85