Search results for "series-parallel graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Andreas Jakoby, Till Tantau	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF	logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
2	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx	Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.	STOC	2010	DBLP DOI BibTeX RDF	Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
2	Fabrizio Frati	A Lower Bound on the Area Requirements of Series-Parallel Graphs.	WG	2008	DBLP DOI BibTeX RDF
2	Jian-Liang Wu, Ping Wang	A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	edge-face coloring, series-parallel graph, decomposition tree
2	Bo Brinkman, Adriana Karagiozova, James R. Lee	Vertex cuts, random walks, and dimension reduction in series-parallel graphs.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithms, dimension reduction, metric embeddings
2	Yuval Emek, David Peleg	A tight upper bound on the probabilistic embedding of series-parallel graphs.	SODA	2006	DBLP DOI BibTeX RDF
2	Shu-Dong Wang, Shan-Chen Pang	The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) >= 4.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	AMS 1991 Subject Classification 05C15
2	Bruno Bachelet, Philippe Mahey	Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs.	4OR	2004	DBLP DOI BibTeX RDF	Minimum cost tension, two-terminal series-parallel digraph, series-parallel recognition, out-of-kilter algorithm, graph decomposition
2	Xiao Zhou, Yuki Matsuo, Takao Nishizeki	List Total Colorings of Series-Parallel Graphs.	COCOON	2003	DBLP DOI BibTeX RDF
2	Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk	Space Efficient Algorithms for Series-Parallel Graphs.	STACS	2001	DBLP DOI BibTeX RDF
2	William C. K. Yen, C. Y. Tang	An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Two-Terminal Series-Parallel Graphs.	Acta Inf.	1999	DBLP DOI BibTeX RDF
2	Hans L. Bodlaender, Babette de Fluiter	Parallel Algorithms for Series Parallel Graphs.	ESA	1996	DBLP DOI BibTeX RDF
2	Andrzej Lingas, Maciej M. Syslo	A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.	ICALP	1988	DBLP DOI BibTeX RDF
1	Anna de Mier, Marc Noy	On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs.	Graphs and Combinatorics	2012	DBLP DOI BibTeX RDF
1	Prasad Chebolu, Mary Cryan, Russell Martin	Exact counting of Euler tours for generalized series-parallel graphs.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
1	Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.	WALCOM	2012	DBLP DOI BibTeX RDF
1	Xin Zhang, Jian-Liang Wu	On equitable and equitable list colorings of series-parallel graphs.	Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Stefan Ruzika, Heike Sperber, Mechthild Steiner	Earliest arrival flows on series-parallel graphs.	Networks	2011	DBLP DOI BibTeX RDF
1	Michael Drmota, Omer Giménez, Marc Noy	The Maximum Degree of Series-Parallel Graphs.	Combinatorics, Probability & Computing	2011	DBLP DOI BibTeX RDF
1	Therese C. Biedl	Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs.	Discrete & Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Anne Benoit, Paul Renaud-Goud, Yves Robert, Rami G. Melhem	Energy-Aware Mappings of Series-Parallel Workflows onto Chip Multiprocessors.	ICPP	2011	DBLP DOI BibTeX RDF	power consumption minimization, chip multiprocessors, scheduling algorithms, series-parallel graphs
1	Fabrizio Frati	Lower Bounds on the Area Requirements of Series-Parallel Graphs.	Discrete Mathematics & Theoretical Computer Science	2010	DBLP BibTeX RDF
1	Michael Drmota, Omer Giménez, Marc Noy	Vertices of given degree in series-parallel graphs.	Random Struct. Algorithms	2010	DBLP DOI BibTeX RDF
1	Prasad Chebolu, Mary Cryan, Russell A. Martin	Exact counting of Euler Tours for generalized series-parallel graphs	CoRR	2010	DBLP BibTeX RDF
1	Kenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey	ESP: pursuit evasion on series-parallel graphs.	AAMAS	2010	DBLP DOI BibTeX RDF
1	Fabrizio Frati	Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs.	Graph Drawing	2010	DBLP DOI BibTeX RDF
1	Anna de Mier, Marc Noy	On the maximum number of cycles in outerplanar and series-parallel graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Salim Achouri, Timothée Bossart, Alix Munier Kordon	A polynomial algorithm for minDSC on a subclass of series Parallel graphs.	RAIRO - Operations Research	2009	DBLP DOI BibTeX RDF
1	Joseph Brennan, Guantao Chen	Toric Geometry of Series-Parallel Graphs.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, David Peleg	A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Satoshi Tayu, Kumiko Nomura, Shuichi Ueno	On the two-dimensional orthogonal drawing of series-parallel graphs.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Therese C. Biedl	Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.	Graph Drawing	2009	DBLP DOI BibTeX RDF
1	Olivier Biton, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy	Optimizing user views for workflows.	ICDT	2009	DBLP DOI BibTeX RDF
1	Konstantinos Panagiotou, Angelika Steger	Maximal biconnected subgraphs of random planar graphs.	SODA	2009	DBLP DOI BibTeX RDF
1	Zhuowei Bao, Sarah Cohen Boulakia, Susan B. Davidson, Anat Eyal, Sanjeev Khanna	Differencing Provenance in Scientific Workflows.	ICDE	2009	DBLP DOI BibTeX RDF
1	Akio Fujiyoshi	Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.	CIAA	2009	DBLP DOI BibTeX RDF
1	Chris Calabro	A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Francisco Javier Zaragoza Martínez	Series-parallel graphs are windy postman perfect.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Xiao Zhou, Takao Nishizeki	Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Satoshi Tayu, Kumiko Nomura, Shuichi Ueno	On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract).	ISCAS	2008	DBLP DOI BibTeX RDF
1	Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger	On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
1	Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman	Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.	Graph Drawing	2008	DBLP DOI BibTeX RDF
1	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
1	Audun Jøsang, Touhid Bhuiyan	Optimal Trust Network Analysis with Subjective Logic.	SECURWARE	2008	DBLP DOI BibTeX RDF
1	Martin Fürer, Shiva Prasad Kasiviswanathan	Approximately Counting Embeddings into Random Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
1	Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki	Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks	The Valve Location Problem in Simple Network Topologies.	WG	2008	DBLP DOI BibTeX RDF	Valve location problem, computational complexity, dynamic programming, binary search, bounded treewidth
1	Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger	How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?	WINE	2008	DBLP DOI BibTeX RDF	Network congestion game, makespan objective, extreme equilibria, complexity, unsplittable flow
1	Elisabeth Gassner, Johannes Hatzl	A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs.	Computing	2008	DBLP DOI BibTeX RDF	Neighbourhood domination, Parity constraints, Distance-hereditary graphs, Bounded treewidth
1	Elisabeth Gassner	The inverse 1-maxian problem with edge length modification.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Obnoxious location, Maxian, Complexity, Tree, Inverse problem
1	Yuki Matsuo, Xiao Zhou, Takao Nishizeki	Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.	IEICE Transactions	2007	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy	Enumeration and limit laws for series-parallel graphs.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
1	Jaroslav Nesetril, Yared Nigussie	Density of universal classes of series-parallel graphs.	Journal of Graph Theory	2007	DBLP DOI BibTeX RDF
1	Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski	Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.	PPAM	2007	DBLP DOI BibTeX RDF
1	Huimin Song, Jianliang Wu, Guizhen Liu	The Equitable Edge-Coloring of Series-Parallel Graphs.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	equitable, edge-coloring, series-parallel graph
1	Xiao Zhou, Takao Nishizeki	Orthogonal drawings of series-parallel graphs with minimum bends.	WALCOM	2007	DBLP BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton	Semi-oblivious routing: lower bounds.	SODA	2007	DBLP DOI BibTeX RDF
1	Chaitanya Swamy	The effectiveness of Stackelberg strategies and tolls for network congestion games.	SODA	2007	DBLP DOI BibTeX RDF
1	James R. Lee, Prasad Raghavendra	Coarse Differentiation and Multi-flows in Planar Graphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
1	Ulrich M. Schwarz	Tightness Results for Malleable Task Scheduling Algorithms.	PPAM	2007	DBLP DOI BibTeX RDF
1	Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi	The location of median paths on grid graphs.	Annals OR	2007	DBLP DOI BibTeX RDF	Median paths, Facility location, Grid graphs
1	Gasper Fijavz	Coloring Weighted Series-Parallel Graphs.	Informatica (Slovenia)	2006	DBLP BibTeX RDF
1	Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju	Boxicity of series-parallel graphs.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Marius Nagy, Selim G. Akl	Real-time minimum vertex cover for two-terminal series-parallel graphs.	IJHPCN	2006	DBLP DOI BibTeX RDF
1	Douglas R. Woodall	Total 4-Choosability of Series-Parallel Graphs.	Electr. J. Comb.	2006	DBLP BibTeX RDF
1	Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk	Space efficient algorithms for directed series-parallel graphs.	J. Algorithms	2006	DBLP DOI BibTeX RDF
1	Andreas Jakoby, Till Tantau	Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.	Complexity of Boolean Functions	2006	DBLP BibTeX RDF
1	Satoshi Tayu, Kumiko Nomura, Shuichi Ueno	On the two-dimensional orthogonal drawing of series-parallel graphs.	ISCAS	2006	DBLP DOI BibTeX RDF
1	Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki	Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.	COCOON	2006	DBLP DOI BibTeX RDF
1	Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki	Approximability of Partitioning Graphs with Supply and Demand.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Arthur Brady, Lenore Cowen	Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.	DISC	2006	DBLP DOI BibTeX RDF
1	Shin-ichiro Kawano, Shin-Ichi Nakano	Generating All Series-Parallel Graphs.	IEICE Transactions	2005	DBLP DOI BibTeX RDF
1	Xiao Zhou, Yuki Matsuo, Takao Nishizeki	List total colorings of series-parallel graphs.	J. Discrete Algorithms	2005	DBLP DOI BibTeX RDF
1	Xiao Zhou, Takao Nishizeki	Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.	ISAAC	2005	DBLP DOI BibTeX RDF	planar graph, series-parallel graph, orthogonal drawing, bend
1	Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki	No-bend Orthogonal Drawings of Series-Parallel Graphs.	Graph Drawing	2005	DBLP DOI BibTeX RDF	SPQ tree, Algorithm, Graph Drawing, Planar Graph, Orthogonal Drawing, Bend
1	Edith Elkind	True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs.	ACM Conference on Electronic Commerce	2005	DBLP DOI BibTeX RDF	shortest paths, auction, mechanism design
1	Bo Brinkman, Moses Charikar	On the impossibility of dimension reduction in l1.	J. ACM	2005	DBLP DOI BibTeX RDF	embedding, Metric spaces, dimension reduction
1	Mohammad Erfanul Hoque Siddiqi, M. Emdadul Haque, M. Shahin, M. Belal Hossan	Spanning trees with restricted degrees for series-parallel graph.	GrC	2005	DBLP DOI BibTeX RDF
1	Takehiro Ito, Xiao Zhou, Takao Nishizeki	Partitioning graphs of supply and demand.	ISCAS	2005	DBLP DOI BibTeX RDF
1	Paolo Detti, Carlo Meloni, Marco Pranzo	Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs.	Electronic Notes in Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	S. Raghavan	Low-connectivity network design on series-parallel graphs.	Networks	2004	DBLP DOI BibTeX RDF
1	Zhishi Pan, Xuding Zhu	Density of the circular chromatic numbers of series-parallel graphs.	Journal of Graph Theory	2004	DBLP DOI BibTeX RDF
1	Jian-Liang Wu, Daiqiang Hu	Total Coloring of Series-Parallel Graphs.	Ars Comb.	2004	DBLP BibTeX RDF
1	Paolo Detti, Carlo Meloni, Marco Pranzo	Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs.	CTW	2004	DBLP BibTeX RDF
1	Margaret Mitchell	Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs.	InVis.au	2004	DBLP BibTeX RDF
1	Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani	Fault Tolerant Algorithms for Orderings and Colorings.	IPDPS	2004	DBLP DOI BibTeX RDF
1	Lisa Fleischer	Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks.	ICALP	2004	DBLP DOI BibTeX RDF
1	Sun-Yuan Hsieh	Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
1	Takehiro Ito, Xiao Zhou, Takao Nishizeki	Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.	WG	2004	DBLP DOI BibTeX RDF
1	Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair	Cuts, Trees and l1-Embeddings of Graphs.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C12, 90C27, 68R10, 05C85
1	Gerard J. Chang, Chiuyuan Chen, Yaping Chen	Vertex and Tree Arboricities of Graphs.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth
1	Guangting Chen, Guoliang Xue	A PTAS for weight constrained Steiner trees in series-parallel graphs.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Xiao Zhou, Takao Nishizeki	Multicolorings of Series-Parallel Graphs.	Algorithmica	2003	DBLP DOI BibTeX RDF	Coloring, Series-parallel graph, Dynamic programming algorithm, Multicoloring
1	Bruno Bachelet, Philippe Mahey	Minimum convex-cost tension problems on series-parallel graphs.	RAIRO - Operations Research	2003	DBLP DOI BibTeX RDF
1	Ephraim Korach, Uri N. Peled	Equistable series-parallel graphs.	Discrete Applied Mathematics	2003	DBLP DOI BibTeX RDF
1	Emilio Di Giacomo	Drawing Series-Parallel Graphs on Restricted Integer 3D Grids.	Graph Drawing	2003	DBLP DOI BibTeX RDF
1	Bo Brinkman, Moses Charikar	On the Impossibility of Dimension Reduction in l1.	FOCS	2003	DBLP DOI BibTeX RDF
1	Mark Korenblit, Vadim E. Levit	On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.	DMTCS	2003	DBLP DOI BibTeX RDF
1	Yuri Ilan	A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
1	Paola Flocchini, Flaminia L. Luccio	Routing in Series Parallel Networks.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF