Search results for "undirected"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
62	Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.	SODA	2008	DBLP BibTeX RDF
56	Andrew V. Goldberg, Satish Rao	Flows in Undirected Unit Capacity Networks.	FOCS	1997	DBLP DOI BibTeX RDF	undirected unit capacity networks, undirected networks, graph theory, computation time, maximum flows
56	Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001	Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities.	COCOON	2008	DBLP DOI BibTeX RDF
52	Matthew Andrews, Lisa Zhang	Logarithmic hardness of the undirected edge-disjoint paths problem.	J. ACM	2006	DBLP DOI BibTeX RDF	Hardness of approximation, undirected graphs, edge-disjoint paths
52	Matthew Andrews, Lisa Zhang	Hardness of the undirected edge-disjoint paths problem.	STOC	2005	DBLP DOI BibTeX RDF	hardness of approximation, undirected graphs, edge-disjoint paths
46	Bao-Xing Chen, Jixiang Meng, Wenjun Xiao	A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks.	MSN	2005	DBLP DOI BibTeX RDF	undirected double-loop networks, Distributed systems, algorithm, shortest path, optimal routing
42	Sushmita Roy, Terran Lane, Margaret Werner-Washburne	Learning structurally consistent undirected probabilistic graphical models.	ICML	2009	DBLP DOI BibTeX RDF
42	Omer Reingold	Undirected connectivity in log-space.	J. ACM	2008	DBLP DOI BibTeX RDF	bounded space algorithms, Derandomization, pseudorandom generator
42	Andrzej Lingas, Eva-Marta Lundell	Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
42	Omer Reingold	Undirected ST-connectivity in log-space.	STOC	2005	DBLP DOI BibTeX RDF
42	Guy Kortsarz, Zeev Nutov	Approximating Node Connectivity Problems via Set Covers.	Algorithmica	2003	DBLP DOI BibTeX RDF	Vertex connected spanning subgraph, Metric costs, Approximation algorithms
39	Zongpeng Li, Baochun Li, Lap Chi Lau	On achieving maximum multicast throughput in undirected networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	undirected networks, multicast, network coding, network flow, duality, Steiner tree, subgradient optimization
39	Kamal Jain, Vijay V. Vazirani, Gideon Yuval	On the capacity of multiple unicast sessions in undirected graphs.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	entropy calculus, undirected capacity, cryptography, network coding, multicommodity flow, network capacity
39	Adam Barclay, Hannes Kaufmann	An Event-Driven, Stochastic, Undirected Narrative (EDSUN) Framework for Interactive Contents.	TIDSE	2006	DBLP DOI BibTeX RDF	stochastic transitions, undirected narrative, augmented reality, framework, grammar, content, event driven, story telling
39	Vladimir Trifonov	An O(log n log log n) space algorithm for undirected st-connectivity.	STOC	2005	DBLP DOI BibTeX RDF	space-efficient simulation of parallel algorithms, undirected st-connectivity, space complexity, space-bounded computation
39	Matthew Andrews, Lisa Zhang	Hardness of the undirected congestion minimization problem.	STOC	2005	DBLP DOI BibTeX RDF	hardness of approximation, undirected graphs, congestion minimization
39	Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou	An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs.	J. ACM	2000	DBLP DOI BibTeX RDF	short pseudorandom walks on graphs, undirected graph connectivity, computational complexity, derandomization, space bounded computations
39	Alain Cournier, Michel Habib	An Efficient Algorithm to Recognize Prime Undirected Graphs.	WG	1992	DBLP DOI BibTeX RDF	substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs
35	Zongpeng Li, Baochun Li, Lap Chi Lau	A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
35	Martin Hofmann 0001, Ulrich Schöpp	Pointer Programs and Undirected Reachability.	LICS	2009	DBLP DOI BibTeX RDF
35	Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.	ICALP (2)	2009	DBLP DOI BibTeX RDF
35	Christian Borgelt	Learning Undirected Possibilistic Networks with Conditional Independence Tests.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
35	Yuhua Liu, Kaihua Xu, Hao Huang, Wei Teng	Research of Undirected Network Capacity Expansion Based on the Spanning-Tree.	SEAL	2006	DBLP DOI BibTeX RDF
35	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke	New lower bounds for oblivious routing in undirected graphs.	SODA	2006	DBLP DOI BibTeX RDF
35	Rezaul Alam Chowdhury, Vijaya Ramachandran	External-memory exact and approximate all-pairs shortest-paths in undirected graphs.	SODA	2005	DBLP BibTeX RDF
35	Einoshin Suzuki	Undirected Exception Rule Discovery as Local Pattern Detection.	Local Pattern Detection	2004	DBLP DOI BibTeX RDF
35	Dorit Dor, Shay Halperin, Uri Zwick	All Pairs Almost Shortest Paths.	FOCS	1996	DBLP DOI BibTeX RDF	all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication
35	Justin Domke, Alap Karapurkar, Yiannis Aloimonos	Who killed the directed model?	CVPR	2008	DBLP DOI BibTeX RDF
35	László Babai	On the diameter of Eulerian orientations of graphs.	SODA	2006	DBLP DOI BibTeX RDF
35	Guy Even, Guy Kortsarz, Wolfgang Slany	On network design problems: fixed cost flows and the covering steiner problem.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Optimization, approximation, graphs, theory, flow
35	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential second-order logic over graphs: Charting the tractability frontier.	J. ACM	2004	DBLP DOI BibTeX RDF	Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory
32	Hua Liu, Huilai Zou, Lili Zhong, Chaonan Wang, Youtian Qu	Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph.	CIT	2010	DBLP DOI BibTeX RDF	undirected complete graph, Optimal Hamilton Circuit, Gradually Convergent Algorithm, Cross-wire Cutting Algorithm, Nearest Neighbor Algorithm
32	Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki	A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs.	Algorithmica	2000	DBLP DOI BibTeX RDF	Edge splitting, Deterministic algorithm, Undirected graph, Polynomial algorithm, Minimum cut, Edge-connectivity, Multigraph
32	H. E. Escuardro, Felix P. Muga II	Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2).	ISPAN	1997	DBLP DOI BibTeX RDF	undirected, graph theory, digraph, de Bruijn graph, wide-diameter
32	Noam Nisan, Endre Szemerédi, Avi Wigderson	Undirected Connectivity in O(log ^1.5 n) Space	FOCS	1992	DBLP DOI BibTeX RDF	recursive doubling technique, connectivity problem, deterministic algorithm, undirected graphs, space complexity
32	Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa	Time-Space Tradeoffs for Undirected Graph Traversal	FOCS	1990	DBLP DOI BibTeX RDF	jumping automata, undirected graph traversal, quadratic lower bound, probabilistic upper bound, time-space tradeoff, deterministic model
32	Miklós Ajtai, Ronald Fagin	Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)	FOCS	1988	DBLP DOI BibTeX RDF	efficiency of algorithms, undirected finite graphs, Ehrenfeucht-Fraisse games, directed graphs, reachability
31	Quanjun Wu, Lan Xiang 0001, Jin Zhou	Average Consensus in Delayed Networks of Dynamic Agents with Impulsive Effects.	Complex (1)	2009	DBLP DOI BibTeX RDF	average consensus, undirected network, impulsive effects, multi-agent systems, time-delays
31	Hiroshi Hosobe	A high-dimensional approach to interactive graph visualization.	SAC	2004	DBLP DOI BibTeX RDF	general undirected graphs, interactive graph layout, information visualization, multidimensional scaling
31	Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida	A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
31	Hans L. Bodlaender, Babette van Antwerpen-de Fluiter	Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.	Algorithmica	2001	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
31	Tzong-Wann Kao, Shi-Jinn Horng	Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems.	ISPAN	1996	DBLP DOI BibTeX RDF	bridge-connected components, reconfigurable bus system, dominator, undirected graphs, bridge, dominator tree, biconnected components, articulation point
31	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
31	Shinji Umeyama	An Eigendecomposition Approach to Weighted Graph Matching Problems.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	weighted graph matching, undirected-graph-matching, Hermitian matrices, directed-graph-matching, pattern recognition, pattern recognition, graph theory, eigenvalues and eigenfunctions, eigendecomposition, adjacency matrices
29	James D. Currie, Lucas Mol	The undirected repetition threshold and undirected pattern avoidance.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
29	James D. Currie, Lucas Mol	The undirected repetition threshold and undirected pattern avoidance.	CoRR	2020	DBLP BibTeX RDF
28	Darin Goldstein, Kojiro Kobayashi	On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.	ISAAC	2007	DBLP DOI BibTeX RDF
28	Christophe Gonzales, Khaled Mellouli, Olfa Mourali	On Directed and Undirected Propagation Algorithms for Bayesian Networks.	ECSQARU	2007	DBLP DOI BibTeX RDF
28	Walid Belkhir, Luigi Santocanale	Undirected Graphs of Entanglement 2.	FSTTCS	2007	DBLP DOI BibTeX RDF
28	Nicolas Beldiceanu, Irit Katriel, Xavier Lorca	Undirected Forest Constraints.	CPAIOR	2006	DBLP DOI BibTeX RDF
28	Qingguo Zhang, Huayong Liu, Wei Zhang, Yajun Guo	Drawing Undirected Graphs with Genetic Algorithms.	ICNC (3)	2005	DBLP DOI BibTeX RDF
28	Peter Mahlmann, Christian Schindelhauer	Peer-to-peer networks based on random transformations of connected regular undirected graphs.	SPAA	2005	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
28	Liam Roditty, Uri Zwick	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
28	Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001	Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.	ISAAC	2002	DBLP DOI BibTeX RDF
28	Ulrich Meyer 0001	External memory BFS on undirected graphs with bounded degree.	SODA	2001	DBLP BibTeX RDF
28	Mikkel Thorup	Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time.	J. ACM	1999	DBLP DOI BibTeX RDF	RAM algorithms, shortest paths
28	John Watrous	Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity.	CCC	1999	DBLP DOI BibTeX RDF	quantum computation, graph connectivity, space-bounded computation
28	John H. Reif	Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time.	ICALP	1981	DBLP DOI BibTeX RDF
28	Zeev Nutov	An almost O(log k)-approximation for k-connected subgraphs.	SODA	2009	DBLP DOI BibTeX RDF
28	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton	Oblivious routing on node-capacitated and directed graphs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	node-capacitated graphs, directed graphs, communication networks, Oblivious routing
28	Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman	On the capacity of information networks.	SODA	2006	DBLP DOI BibTeX RDF
28	Tamás Király, Lap Chi Lau	Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs.	FOCS	2006	DBLP DOI BibTeX RDF
28	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke	Oblivious routing on node-capacitated and directed graphs.	SODA	2005	DBLP BibTeX RDF
28	Guy Kortsarz, Zeev Nutov	Approximation algorithm for k-node connected subgraphs via critical graphs.	STOC	2004	DBLP DOI BibTeX RDF
28	Edith Hemaspaandra, Holger Spakowski, Mayur Thakur	Complexity of Cycle Length Modularity Problems in Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
28	Andreas Jakoby, Maciej Liskiewicz	Paths Problems in Symmetric Logarithmic Space.	ICALP	2002	DBLP DOI BibTeX RDF
28	Guy Even, Guy Kortsarz, Wolfgang Slany	On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.	SWAT	2002	DBLP DOI BibTeX RDF
28	Stavros G. Kolliopoulos, Clifford Stein 0001	Improved Approximation Algorithms for Unsplittable Flow Problems.	FOCS	1997	DBLP DOI BibTeX RDF
24	Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan	On a discretizable subclass of instances of the molecular distance geometry problem.	SAC	2009	DBLP DOI BibTeX RDF	protein backbone, protein molecules, undirected weighted graph, distance geometry, combinatorialization
24	Maytham Safar, Hisham Farahat, Khaled Mahdi	Analysis of dynamic social network: e-mail messages exchange network.	iiWAS	2009	DBLP DOI BibTeX RDF	cyclic entropy, email analysis, undirected, graphs, cycles, directed
24	Ajith Abraham, Hongbo Liu 0001, Youakim Badr, Crina Grosan	A multi-swarm approach for neighbor selection in peer-to-peer networks.	CSTST	2008	DBLP DOI BibTeX RDF	P2P swarming networks, genetic algorithm, undirected graph, particle swarm, neighbor selection
24	Xuerui Wang, Chris Pal, Andrew McCallum	Generalized component analysis for text with heterogeneous attributes.	KDD	2007	DBLP DOI BibTeX RDF	author prediction, multimodal heterogeneous data, recipient prediction, undirected graphical models, text mining, topic modeling
24	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki	Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.	Algorithmica	2006	DBLP DOI BibTeX RDF	Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm
24	Eric Louie, Tsau Young Lin	Semantics and Syntactic Patterns in Data.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF	interesting-ness, undirected association rules, Data mining, semantics, isomorphism
24	Christian Capelle, Michel Habib	Graph decompositions and factorizing permutations.	ISTCS	1997	DBLP DOI BibTeX RDF	factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree
24	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
24	Steven Homer, Marcus Peinado	A highly parallel algorithm to approximate MaxCut on distributed memory architectures.	IPPS	1995	DBLP DOI BibTeX RDF	MaxCut, maximum weight cut, weighted undirected graph, linear speedup, parallel algorithms, parallel algorithm, graph theory, distributed memory systems, distributed memory architectures, Connection Machine
24	Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng	Recognizing depth-first-search trees in parallel.	IPPS	1995	DBLP DOI BibTeX RDF	depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model
24	Ernst W. Mayr	Scheduling interval orders in parallel.	HICSS (2)	1995	DBLP DOI BibTeX RDF	interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems
24	Jin-Tai Yan, Pei-Yung Hsiao	A new fuzzy-clustering-based approach for two-way circuit partitioning.	VLSI Design	1995	DBLP DOI BibTeX RDF	fuzzy-clustering-based approach, two-way circuit partitioning, circuit netlist, undirected edge-weighted graph, tree net model, clustering distance, area information, area-balanced constraints, circuit benchmarks, VLSI, simulated annealing, network topology, trees (mathematics), fuzzy set theory, logic partitioning, fuzzy c-means clustering, fuzzy memberships
24	Zhenyu Wu, Richard M. Leahy	An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	optimal graph theoretic approach, undirected adjacency graph, arc capacities, mutually exclusive subgraphs, largest inter-subgraph maximum flow minimization, flow and cut equivalent tree partitioning, subgraph condensation, partially equivalent tree, region boundary location, closed edge contours, pattern recognition, image segmentation, image segmentation, graph theory, data clustering, minimax techniques
24	Joseph E. Grimes	Scheduling to reduce conflict in meetings.	Commun. ACM	1970	DBLP DOI BibTeX RDF	conflict matrix, undirected linear graph, scheduling, spanning tree, allocation, connected component
21	John Thomas, Naren Ramakrishnan, Chris Bailey-Kellogg	Protein Design by Sampling an Undirected Graphical Model of Residue Constraints.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	residue coupling, Markov chain Monte Carlo (MCMC), graphical models, Protein design
21	María Luisa Pérez-Delgado	Rank-Based Ant System to Solve the Undirected Rural Postman Problem.	IWANN (2)	2009	DBLP DOI BibTeX RDF	Rural Postman Problem, Traveling Salesman Problem, Artificial ants
21	Ian Walsh, Alessandro Vullo, Gianluca Pollastri	Recursive Neural Networks for Undirected Graphs for Learning Molecular Endpoints.	PRIB	2009	DBLP DOI BibTeX RDF
21	Xiaofeng Gu, Kamesh Madduri, K. Subramani 0001, Hong-Jian Lai	Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.	FAW	2009	DBLP DOI BibTeX RDF
21	Ulrich Schöpp	A Formalised Lower Bound on Undirected Graph Reachability.	LPAR	2008	DBLP DOI BibTeX RDF
21	SeungJin Lim	An Interactive, 3D Visual Exploration Tool for Undirected Relationships.	ISM	2008	DBLP DOI BibTeX RDF
21	Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens	An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
21	Toshimasa Ishii	Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
21	Luca Allulli, Peter Lichodzijewski, Norbert Zeh	A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.	SODA	2007	DBLP BibTeX RDF
21	Yan Liu 0002, Jun Yang 0003, Alexander G. Hauptmann	Undirected Graphical Models for Video Analysis and Classification.	ICME	2007	DBLP DOI BibTeX RDF
21	S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Kelli Carlson, Gerhard Kramer	The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network.	ICPP Workshops	2007	DBLP DOI BibTeX RDF
21	Chunguang Ma, Peng Wu, Lingling Wang, Guoyin Zhang	A Novel Method to Authenticate Transitively Closed Undirected Graph.	IMSCCS	2007	DBLP DOI BibTeX RDF	transitively closed graph, one-way accumulators, authentication, signatures
21	Gerhard Reinelt, Dirk Oliver Theis	A note on the Undirected Rural Postman Problem polytope.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57, 05c45
21	Timothy M. Chan	All-pairs shortest paths for unweighted undirected graphs in o(mn) time.	SODA	2006	DBLP DOI BibTeX RDF
21	Ulrich Meyer 0001, Norbert Zeh	I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths.	ESA	2006	DBLP DOI BibTeX RDF
21	Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo	On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.	ICALP (1)	2006	DBLP DOI BibTeX RDF
21	Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond	The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.	IWPEC	2006	DBLP DOI BibTeX RDF
21	Dariusz R. Kowalski, Andrzej Pelc	Broadcasting in undirected ad hoc radio networks.	Distributed Comput.	2005	DBLP DOI BibTeX RDF	Broadcasting, Distributed, Randomized, Radio network, Deterministic