Search results for "Disjoint"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
80	Christian Glaßer, Alan L. Selman, Samik Sengupta	Reductions between Disjoint NP-Pairs.	CCC	2004	DBLP DOI BibTeX RDF
77	Ching-Wen Chen, Chung-Ping Chung	Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving.	J. Supercomput.	2005	DBLP DOI BibTeX RDF	gamma interconnection networks, rerouting hops, collision ratio, multistage interconnection networks, disjoint paths, dynamic rerouting
74	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Baseline Networks with Node-Disjoint Paths.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths
69	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
68	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths.	ICPADS	2004	DBLP DOI BibTeX RDF
68	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange
68	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks.	ICPP	2002	DBLP DOI BibTeX RDF	link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange
65	Anand Srinivas, Eytan H. Modiano	Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks.	Wirel. Networks	2005	DBLP DOI BibTeX RDF	distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths
65	Anand Srinivas, Eytan H. Modiano	Minimum energy disjoint path routing in wireless ad-hoc networks.	MobiCom	2003	DBLP DOI BibTeX RDF	distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy
63	Peng Zhang 0008, Wenbo Zhao 0001	On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.	ESCAPE	2007	DBLP DOI BibTeX RDF
60	Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman	Algorithms for fault-tolerant routing in circuit switched networks.	SPAA	2002	DBLP DOI BibTeX RDF	flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
60	Olaf Beyersdorff	Tuples of Disjoint NP-Sets.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Propositional proof systems, Disjoint -pairs
60	Naoki Sawada, Keiichi Kaneko, Shietung Peng	Pairwise Disjoint Paths in Pancake Graphs.	PDCAT	2007	DBLP DOI BibTeX RDF	interconnection networks, polynomial time algorithm, disjoint paths
57	Torsten Tholey	Solving the 2-Disjoint Paths Problem in Nearly Linear Time.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
57	Christian Glaßer, Alan L. Selman, Liyu Zhang	Canonical Disjoint NP-Pairs of Propositional Proof Systems.	MFCS	2005	DBLP DOI BibTeX RDF
57	Torsten Tholey	Solving the 2-Disjoint Paths Problem in Nearly Linear Time.	STACS	2004	DBLP DOI BibTeX RDF
57	Qian-Ping Gu, Shietung Peng	An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.	ICPADS	1996	DBLP DOI BibTeX RDF	set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths
57	Paraskevi Fragopoulou, Selim G. Akl	Fault tolerant communication algorithms on the star network using disjoint paths.	HICSS (2)	1995	DBLP DOI BibTeX RDF	fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes
57	Ulrich Herrmann, Peter Dadam, Klaus Küspert, E. A. Roman, Gunter Schlageter	A Lock Technique for Disjoint and Non-Disjoint Complex Objects.	EDBT	1990	DBLP DOI BibTeX RDF
54	Ali Asghar Khavasi, Nastooh Taheri Javan	Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks.	ICIS	2009	DBLP DOI BibTeX RDF	video multi-path transmission, zone-disjoint paths, MANET, multi-path routing
54	Weiguo Zhang, Mian Cai, Guozhen Xiao	On constructing disjoint linear codes.	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	disjoint linear codes, cryptography, linear code, resilient function
51	Mohammad R. Salavatipour, Jacques Verstraëte	Disjoint Cycles: Integrality Gap, Hardness, and Approximation.	IPCO	2005	DBLP DOI BibTeX RDF
51	Klaus D. Heidtmann	Statistical Comparison of Two Sum-of-Disjoint-Product Algorithms for Reliability and Safety Evaluation.	SAFECOMP	2002	DBLP DOI BibTeX RDF
51	Mariusz Rawski	Non-Disjoint Decomposition of Boolean Functions and Its Application in FPGA-oriented Technology Mapping.	EUROMICRO	1997	DBLP DOI BibTeX RDF
51	Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo	Kernel Bounds for Disjoint Cycles and Disjoint Paths.	ESA	2009	DBLP DOI BibTeX RDF
49	Nastooh Taheri Javan, Mehdi Dehghan 0001	Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks.	MSN	2007	DBLP DOI BibTeX RDF	Zone-Disjoint Paths, MANET, Routing Algorithms, Multi-Path Routing
48	Sungwoo Tak, E. K. Park	Restoration performance study of k-shortest disjoint paths in WDM optical networks.	Telecommun. Syst.	2007	DBLP DOI BibTeX RDF	Shortest disjoint paths, Dynamic programming principle, Optimization, Restoration, WDM optical networks
48	Ash Mohammad Abbas, Mansoor Alam, Bijendra Nath Jain	Alleviating path correlation using directional antenna in node-disjoint multipath routing for mobile ad hoc networks.	IWCMC	2007	DBLP DOI BibTeX RDF	forbidden zone, node-disjoint multipath routing, path correlation, path independence, pseudo-directional antenna
48	Stavros G. Kolliopoulos, Clifford Stein 0001	Approximating disjoint-path problems using packing integer programs.	Math. Program.	2004	DBLP DOI BibTeX RDF	packing integer programs, approximation algorithms, edge-disjoint paths
48	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees.	Algorithmica	2000	DBLP DOI BibTeX RDF	Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
48	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).	ISAAC	1996	DBLP DOI BibTeX RDF	bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
45	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
45	Mehmet Hakan Karaata, Rachid Hadid	Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks.	SSS	2009	DBLP DOI BibTeX RDF
45	Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani	Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
45	Olaf Beyersdorff	Tuples of Disjoint NP-Sets.	CSR	2006	DBLP DOI BibTeX RDF
45	Spyros Tragoudas, Yaakov L. Varol	Computing Disjoint Path with Lenght Constraints.	WG	1996	DBLP DOI BibTeX RDF
43	Hagit Attiya, Eshcar Hillel, Alessia Milani	Inherent limitations on disjoint-access parallel implementations of transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	disjoint-access parallelism, partial snapshots, lower bound, transactional memory, impossibility result
43	Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean	Line transversals to disjoint balls.	SCG	2007	DBLP DOI BibTeX RDF	Hadwiger-type theorem, Helly-type theorem, disjoint balls, geometric transversal theory, convexity, lines, Hessian
43	Luo Liu, Laurie G. Cuthbert	Qos in node-disjoint routing for ad hoc networks.	PE-WASUN	2007	DBLP DOI BibTeX RDF	agent-based SLA management, multipath, node-disjoint
43	Jang-Woon Baek, Young Jin Nam, Dae-Wha Seo	An Energy-Efficient k -Disjoint-Path Routing Algorithm for Reliable Wireless Sensor Networks.	SEUS	2007	DBLP DOI BibTeX RDF	data variation, disjoint-path routing, Wireless sensor networks
43	Bing Yang 0001, S. Q. Zheng 0001	Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.	TAMC	2006	DBLP DOI BibTeX RDF	algorithm, routing, reliability, complexity, network, graph, shortest path, survival, disjoint paths
43	Xuefei Li, Laurie G. Cuthbert	A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks.	MSWiM	2004	DBLP DOI BibTeX RDF	ad hoc networks, multipath routing, low overhead, node-disjoint
40	Siuli Roy, Somprakash Bandyopadhyay, Tetsuro Ueda, Kazuo Hasuike	Multipath Routing in Ad Hoc Wireless Networks with Omni Directional and Directional Antenna: A Comparative Study.	IWDC	2002	DBLP DOI BibTeX RDF
40	Chao-Lieh Chen, Jeng-Wei Lee, Jia-Ming Yang, Yau-Hwang Kuo	Efficient and Load-Balance Overlay Multicast Scheme with Path Diversity for Video Streaming.	EUC	2007	DBLP DOI BibTeX RDF	hierarchical independent tree, path-disjoint, load-balance, overlay multicast, topology-aware, node-disjoint
40	Frank Kammer, Torsten Tholey	The k-Disjoint Paths Problem on Chordal Graphs.	WG	2009	DBLP DOI BibTeX RDF
40	Daeho Seo, Mithuna Thottethodi	Disjoint-path routing: Efficient communication for streaming applications.	IPDPS	2009	DBLP DOI BibTeX RDF
40	Zachary Friggstad, Mohammad R. Salavatipour	Approximability of Packing Disjoint Cycles.	ISAAC	2007	DBLP DOI BibTeX RDF
40	Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami	An Efficient Construction of Node Disjoint Paths in OTIS Networks.	APPT	2007	DBLP DOI BibTeX RDF
40	Ash Mohammad Abbas, Tehzeeb Ahmed Abbasi	An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks.	COMSWARE	2007	DBLP DOI BibTeX RDF
40	Torsten Tholey	Finding Disjoint Paths on Directed Acyclic Graphs.	WG	2005	DBLP DOI BibTeX RDF
40	Jung-Heum Park	One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.	COCOON	2004	DBLP DOI BibTeX RDF
40	Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang	Disjoint NP-Pairs.	CCC	2003	DBLP DOI BibTeX RDF
40	Jon M. Kleinberg, Éva Tardos	Disjoint Paths in Densely Embedded Graphs.	FOCS	1995	DBLP DOI BibTeX RDF	densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh
40	Samir Khuller, Baruch Schieber	Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)	FOCS	1989	DBLP DOI BibTeX RDF	k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM
40	Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani	Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph	FOCS	1989	DBLP DOI BibTeX RDF	disjoint paths problem, Kuratowski homeomorph, vertex-disjoint paths, NC planarity algorithms, processor-time product, routing, parallel algorithms, sequential algorithm, planar embedding, polylogarithmic factor
37	Petr A. Golovach, Dimitrios M. Thilikos	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF	Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms
37	Yuichiro Hei, Akihiro Nakao, Toru Hasegawa, Tomohiko Ogishi, Shu Yamamoto	AS alliance: cooperatively improving resilience of intra-alliance communication.	CoNEXT	2008	DBLP DOI BibTeX RDF	AS alliance, multipath routing, disjoint path, interdomain routing
37	Yeim-Kuan Chang	A 2-Level TCAM Architecture for Ranges.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	disjoint ranges, contiguous ranges, ranges, TCAM
37	Arunabha Sen, Bin Hao, Bao Hong Shen, Sudheendra Murthy, Samrat Ganguly	On Multipath Routing with Transit Hubs.	NETWORKING	2005	DBLP DOI BibTeX RDF	transit hub, multipath routing, disjoint path, network resilience
37	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
37	Saeedeh Bakhshi, Hamid Sarbazi-Azad	One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks.	ISPAN	2008	DBLP DOI BibTeX RDF	Multi-computers, WK-recursive, Parallel routing, interconnection networks, node-disjoint paths
37	Joseph Cheriyan, Mohammad R. Salavatipour	Packing element-disjoint steiner trees.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing
37	Christopher S. Madden, Eric Dahai Cheng, Massimo Piccardi	Tracking people across disjoint camera views by an illumination-tolerant appearance representation.	Mach. Vis. Appl.	2007	DBLP DOI BibTeX RDF	Disjoint camera views, Online k-means clustering, Object similarity measurement, Tracking, Colour histograms
37	Shangming Zhu, Zhili Zhang, Xinhua Zhuang	Modified Widest Disjoint Paths Algorithm for Multipath Routing.	NPC	2007	DBLP DOI BibTeX RDF	Widest disjoint paths, candidate path, width of path set, multipath routing
37	Dongxue Jin, Zhipeng Liu, Chonggun Kim	A Packet Distribution Method for Energy Balancing on Node-Disjoint Multipath of MANETs.	ICIC (3)	2007	DBLP DOI BibTeX RDF	packet distribution, energy, Ad Hoc, multipath, node-disjoint
37	Moon Jeong Kim, Dong Hoon Lee 0001, Young Ik Eom	Enhanced Non-disjoint Multi-path Source Routing Protocol for Wireless Ad-Hoc Networks.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	enhanced wireless ad-hoc network, multi-path routing protocol, node/link non-disjoint route, on-demand routing protocol
37	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
37	Hsien-Jone Hsieh, Dyi-Rong Duh	Constructing Node-Disjoint Paths in Enhanced Pyramid Networks.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter
37	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-disjoint paths in Planar graphs with constant congestion.	STOC	2006	DBLP DOI BibTeX RDF	Planar graphs, multicommodity flow, edge-disjoint paths
37	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
37	Keiichi Kaneko	Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs.	ISPA	2004	DBLP DOI BibTeX RDF	node-to-set disjoint paths problem, bi-rotator graphs, fault tolerance, parallel computation
37	Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh	Constructing One-to-Many Disjoint Paths in Folded Hypercubes.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	folded hypercube, Rabin number, hypercube, optimization problem, Disjoint paths
37	Qian-Ping Gu, Hisao Tamaki	Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.	IPPS	1996	DBLP DOI BibTeX RDF	algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks
34	Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir	Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
34	Joengmin Hwang, David Hung-Chang Du, Ewa Kusmierek	Energy Efficient Organization of Mobile Sensor Networks.	ICPP Workshops	2004	DBLP DOI BibTeX RDF
34	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	The Induced Disjoint Paths Problem.	IPCO	2008	DBLP DOI BibTeX RDF
34	Wei Cheng 0001, Kai Xing, Xiuzhen Cheng 0001, Xicheng Lu, Zexin Lu, Jinshu Su, Baosheng Wang, Yujun Liu	Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks.	MobiHoc	2008	DBLP DOI BibTeX RDF	multipath determinability, route recovery, wireless sensor networks, multipath routing
34	Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu, Suresh Rai	A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network.	PRDC	2008	DBLP DOI BibTeX RDF
34	Martin Grohe, Magdalena Grüber	Parameterized Approximability of the Disjoint Cycle Problem.	ICALP	2007	DBLP DOI BibTeX RDF	parameterized complexity theory, approximation algorithms, fixed-parameter tractability
34	Fengye Wang, Qiang Zhang	Some Properties of Disjoint Variation of Fuzzy Set Functions.	FSKD (1)	2007	DBLP DOI BibTeX RDF
34	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	fault-Hamiltonicity, strong Hamiltonicity, recursive circulants, restricted HL-graphs, Fault tolerance, graph theory, embedding, network topology
34	Srinivasan Ramasubramanian, Mithun Harkara, Marwan Krunz	Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing.	Networking	2006	DBLP DOI BibTeX RDF
34	Zhaohui Sun, Anthony Hoogs	Image Comparison by Compound Disjoint Information.	CVPR (1)	2006	DBLP DOI BibTeX RDF
34	Pascale Charpin, Enes Pasalic	Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	AMS Classification: 11T71
34	Elena Dubrova	A Polynomial Time Algorithm for Non-Disjoint Decomposition of Multiple-Valued Functions.	ISMVL	2004	DBLP DOI BibTeX RDF
34	Ann Nowé, Katja Verbeeck, Peter Vrancx	Multi-type Ant Colony: The Edge Disjoint Paths Problem.	ANTS Workshop	2004	DBLP DOI BibTeX RDF
34	Myung M. Bae, Bella Bose	Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Lee distance Gray codes, binary Gray codes, hypercube, Hamiltonian cycle, k-ary n-cubes, Lee distance
34	Frédéric Gardi	Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems.	DMTCS	2003	DBLP DOI BibTeX RDF
34	Calogero G. Zarba	A Tableau Calculus for Combining Non-disjoint Theories.	TABLEAUX	2002	DBLP DOI BibTeX RDF
34	Norbert Völker	Disjoint Sums over Type Classes in HOL.	TPHOLs	1999	DBLP DOI BibTeX RDF
34	Gerald W. Schuster	A Minimum Degree Result for Disjoint Cycles and Forests in Graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C05, 05C35, 05C38
34	Vishwani D. Agrawal, Sharad C. Seth	Mutually Disjoint Signals and Probability Calculation in Digital Circuits.	Great Lakes Symposium on VLSI	1998	DBLP DOI BibTeX RDF	Testing, Digital circuits, Signal probabilities, Syndrome
34	Michael Nicolaidis	Fault secure property versus strongly code disjoint checkers.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
34	Howard Aizenstein, Leonard Pitt	Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF.	COLT	1992	DBLP DOI BibTeX RDF
31	Aminollah Mahabadi, Hamid Sarbazi-Azad, Ebrahim Khodaie, Keivan Navi	Parallel Lagrange interpolation on k -ary n -cubes with maximum channel utilization.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Link-disjoint Hamiltonian cycles, Parallel algorithms, Performance analysis, Interconnection networks, Multicomputers, k-ary n-cubes, Lagrange interpolation
31	Aladár Heppes	Line Transversals in Large T (3)- and T (4)-Families of Congruent Discs.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Disc, d-disjoint, Line transversal
31	Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster	Approximation algorithms and hardness results for cycle packing problems.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
31	Koushik Kar, Murali S. Kodialam, T. V. Lakshman	Routing restorable bandwidth guaranteed connections using maximum 2-route flows.	IEEE/ACM Trans. Netw.	2003	DBLP DOI BibTeX RDF	2-route flow, routing, restoration, disjoint path
31	Qian-Ping Gu, Shietung Peng	Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.	IPDPS	2000	DBLP DOI BibTeX RDF	multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations
31	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs.	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model