Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong	Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	rectilinear metric, Computational geometry, shortest paths, minimum spanning trees, Steiner trees, obstacles
19	Bhabani P. Sinha, Bhargab B. Bhattacharya, Suranjan Ghose, Pradip K. Srimani	A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	parallel algorithms, pipelining, shortest paths, VLSI architecture, Diameter
19	Krishna Kant 0001	Finding Interferences Between Rectangular Paths.	IEEE Trans. Computers	1985	DBLP DOI BibTeX RDF	rectangular paths, routing, intersection, Backtrack, overlap
19	Gopal Lakhani	An Improved Distribution Algorithm for Shortest Paths Problem.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	shortest paths computation, Distributed algorithms, pipelining, VLSI layout, systolic architecture
18	S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi	Dynamic shortest path problems with time-varying costs.	Optim. Lett.	2010	DBLP DOI BibTeX RDF	Time-varying networks, Labeling algorithms, Dynamic shortest paths
18	Sophie Stellmach, Lennart E. Nacke, Raimund Dachselt	Advanced gaze visualizations for three-dimensional virtual environments.	ETRA	2010	DBLP DOI BibTeX RDF	attentional maps, gaze visualizations, virtual environments, eye tracking, eye movements, three-dimensional, scan paths
18	Piet Van Mieghem, Huijuan Wang	The observable part of a network.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	union of shortest paths, observability, overlay
18	Tadao Takaoka	Partial Solution and Entropy.	MFCS	2009	DBLP DOI BibTeX RDF	adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees
18	Manohar B. Srikanth, P. C. Mathias, Vijay Natarajan, Prakash Naidu, Timothy Poston	Visibility volumes for interactive path optimization.	Vis. Comput.	2008	DBLP DOI BibTeX RDF	Flight paths, Force-directed ropes, Haptics, Multimodal interaction, Visibility analysis
18	Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee	Two Variations of the Minimum Steiner Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time
18	Stelios Neophytou, Maria K. Michael, Spyros Tragoudas	Test set enhancement for quality transition faults using function-based methods.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	high quality test, ATPG, delay test, critical paths, transition fault, test compaction
18	Felipe S. Marques 0001, Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis	A new approach to the use of satisfiability in false path detection.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	unateness, satisfiability, false paths
18	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
18	Sudip Misra, B. John Oommen	Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem.	IEA/AIE	2004	DBLP DOI BibTeX RDF	Intelligent Systems, Learning Automata, Dynamic Shortest Paths
18	Islene C. Garcia, Luiz Eduardo Buzato	On the Minimal Characterization of the Rollback-Dependency Trackability Property.	ICDCS	2001	DBLP DOI BibTeX RDF	zigzag paths, fault-tolerance, Distributed algorithms, rollback recovery, distributed checkpointing
18	Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya	A Blocked All-Pairs Shortest-Path Algorithm.	SWAT	2000	DBLP DOI BibTeX RDF	cache, blocking, speedup, All pairs shortest paths
18	Jing-Jia Liou, Kwang-Ting Cheng, Deb Aditya Mukherjee	Path Selection for Delay Testing of Deep Sub-Micron Devices Using Statistical Performance Sensitivity Analysis.	VTS	2000	DBLP DOI BibTeX RDF	delay defects, delay fault modeling, delay testing, critical paths, statistical timing analysis
18	Qian-Ping Gu, Shietung Peng	Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.	ICPP	2000	DBLP DOI BibTeX RDF	WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations
18	Theodora A. Varvarigou, Miltiades E. Anagnostou, Sudhir R. Ahuja	Reconfiguration Models and Algorithms for Stateful Interactive Processes.	IEEE Trans. Software Eng.	1999	DBLP DOI BibTeX RDF	Reconfiguration of stateful processes, compensation paths, optimal centralized algorithms, suboptimal distributed and hybrid algorithms, polynomial-time algorithms
18	Jean-Pierre Braquelaire, Anne Vialard	A new antialiasing approach for image compositing.	Vis. Comput.	1997	DBLP DOI BibTeX RDF	Discrete regions, Discrete contours, Euclidean paths, Antialiasing, Image compositing
18	Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks	On the totalk-diameter of connection networks.	ISTCS	1997	DBLP DOI BibTeX RDF	k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network
18	Mikkel Thorup	Undirected Single Source Shortest Path in Linear Time.	FOCS	1997	DBLP DOI BibTeX RDF	single source shortest paths problem, algorithmic graph theory, deterministic linear time, hierarchical bucketing, deterministic algorithms, linear time, weighted graph, Dijkstra's algorithm, linear space
18	Ananta K. Majhi, James Jacob, Lalit M. Patnaik, Vishwani D. Agrawal	On test coverage of path delay faults.	VLSI Design	1996	DBLP DOI BibTeX RDF	two-pass test generation method, falling transition, line delay test, longest sensitizable path, decreasing length, redundant stuck-at fault, computational complexity, fault diagnosis, logic testing, delays, redundancy, combinational circuits, fault simulation, circuit analysis computing, test coverage, path delay faults, benchmark circuits, coverage metric, combinational logic circuits, longest paths
18	Lance R. Williams, David W. Jacobs	Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience.	ICCV	1995	DBLP DOI BibTeX RDF	stochastic completion fields, illusory contour shape, boundary completion shape, mammalian visual cortex, boundary fragments, vector-field convolutions, maximum likelihood paths, curves of least energy, illusory contours, illusory contour stimuli, computational geometry, probability, edge detection, image recognition, random walk, computer model, lattice, neural nets, maximum likelihood estimation, probability distribution, neural model, image plane
18	Michele Flammini, Giorgio Gambosi, Sandro Salomone	On Devising Boolean Routing Schemes.	WG	1995	DBLP DOI BibTeX RDF	shortest paths representation, Parallel and distributed systems, compact routing tables
18	Frank Thomson Leighton, Bruce M. Maggs	Fast algorithms for finding O(congestion+dilation) packet routing schedules.	HICSS (2)	1995	DBLP DOI BibTeX RDF	packet routing schedules, fixed edge-simple paths, constant-size queues, algorithm parallelization, parallel algorithms, computational complexity, multiprocessor interconnection networks, packet switching, congestion, processor scheduling, telecommunication network routing, fast algorithms, dilation, Lovasz local lemma
18	Habib Youssef, Sadiq M. Sait, Khaled Nassar, Muhammad S. T. Benten	Performance driven standard-cell placement using the genetic algorithm.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	connection length, timing-driven placer, /spl alpha/-criticality, delay performance improvement, genetic algorithms, genetic algorithm, delays, timing, logic CAD, circuit layout CAD, cellular arrays, integrated circuit layout, critical paths, area, propagation delays, wire length, timing performance, IC design, standard-cell placement
18	Alexander Saldanha, Narendra V. Shenoy, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Functional clock schedule optimization.	VLSI Design	1995	DBLP DOI BibTeX RDF	clock schedule optimization, time frames, level-sensitive sequential circuits, scheduling, delays, delays, timing, sequential circuits, flip-flops, clocks, circuit optimisation, latches, false paths
18	Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz	Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	adaptive minimal deadlock-free packet routing, virtual cut-through routing models, simulations, algorithms, concurrency control, message passing, hypercubes, multiprocessor interconnection networks, multiprocessor interconnection networks, meshes, packet switching, parallel machines, parallel machines, routing algorithms, deadlock, packet routing, shuffle-exchange, minimal paths, two-dimensional mesh
18	Khaled Day, Anand R. Tripathi	A Comparative Study of Topological Properties of Hypercubes and Star Graphs.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	networktopology, interconnection network topologies, comparativestudy, parallel paths, asymptotically balanced, balanced spanning trees, graph theory, graph theory, hypercubes, multiprocessor interconnection networks, hypercube networks, spanning trees, star graphs, greedy
18	Mee Yee Chan, Francis Y. L. Chin	A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	grid mapping, 2D grids, embedding strategy, minimal dilation, communication paths, grid-neighbors, node congestion, parallel algorithm, parallel algorithms, parallelization, hypercubes, hypercube networks
18	Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu	On the Parallel Computation of the Algebraic Path Problem.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem
18	Yu Cai 0002	A thin-layer protocol for utilizing multiple paths.	IROS	2009	DBLP DOI BibTeX RDF
18	Steven D. Prager, William M. Spears	A hybrid evolutionary-graph approach for finding functional network paths.	GIS	2009	DBLP DOI BibTeX RDF	functional routes, multicriteria shortest path, street networks, routing
18	Yang Cao, Chunhua Hu, Luming Li	Search-based multi-paths test data generation for structure-oriented testing.	GEC Summit	2009	DBLP DOI BibTeX RDF	structure-oriented, genetic algorithms, software testing, automation test, path testing
18	Julien Mille, Laurent D. Cohen	Geodesically Linked Active Contours: Evolution Strategy Based on Minimal Paths.	SSVM	2009	DBLP DOI BibTeX RDF
18	Vasilis F. Pavlidis, Giovanni De Micheli	Power distribution paths in 3-D ICS.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	power distribution network, 3-D ICS, 3-D integration, through silicon vias
18	Eddie Cheng 0001, Shuhong Gao, Ke Qiu 0001, Zhizhang Shen	On Disjoint Shortest Paths Routing on the Hypercube.	COCOA	2009	DBLP DOI BibTeX RDF
18	Torsten Tholey	Improved Algorithms for the 2-Vertex Disjoint Paths Problem.	SOFSEM	2009	DBLP DOI BibTeX RDF
18	Yanghua Xiao, Wentao Wu 0001, Jian Pei, Wei Wang 0009, Zhenying He	Efficiently indexing shortest paths by exploiting symmetry in graphs.	EDBT	2009	DBLP DOI BibTeX RDF
18	Chunrong Song, Spyros Tragoudas	Identification of Critical Executable Paths at the Architectural Level.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
18	Dian Fan, Yee Sin Chan, Xunqi Yu, James W. Modestino	Network-adaptive transport of motion-compensated fine granularity scalability video using multiple asymmetric paths.	ICIP	2008	DBLP DOI BibTeX RDF
18	Ken-ichi Kawarabayashi, Bruce A. Reed	A nearly linear time algorithm for the half integral disjoint paths packing.	SODA	2008	DBLP BibTeX RDF
18	Mahesh Mohan, Rahul Sawhney, K. Madhava Krishna, K. Srinathan, Manohar B. Srikanth	Covering hostile terrains with partial and complete visibilities: On minimum distance paths.	IROS	2008	DBLP DOI BibTeX RDF
18	Ling Xu, Anthony Stentz	Blended local planning for generating safe and feasible paths.	IROS	2008	DBLP DOI BibTeX RDF
18	Xuefeng Yin, Gerhard Steinböck, Gunvor Elisabeth Kirkelund, Troels Pedersen, Peter Blattnig, A. Jaquier, Bernard H. Fleury	Tracking of Time-Variant Radio Propagation Paths Using Particle Filtering.	ICC	2008	DBLP DOI BibTeX RDF
18	Liam Roditty, Asaf Shapira	All-Pairs Shortest Paths with a Sublinear Additive Error.	ICALP (1)	2008	DBLP DOI BibTeX RDF
18	Yuuri Sugihara, Yohei Kume, Kazutoshi Kobayashi, Hidetoshi Onodera	Performance optimization by track swapping on critical paths utilizing random variations for FPGAS.	FPL	2008	DBLP DOI BibTeX RDF
18	Alireza Esfahani, Morteza Analoui	Widest K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks.	CSSE (4)	2008	DBLP DOI BibTeX RDF
18	Irith Pomeranz, Sudhakar M. Reddy	Design-for-Testability for Improved Path Delay Fault Coverage of Critical Paths.	VLSI Design	2008	DBLP DOI BibTeX RDF
18	Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos K. Sellis	On-line discovery of hot motion paths.	EDBT	2008	DBLP DOI BibTeX RDF
18	B. John Oommen, Sudip Misra, Ole-Christoffer Granmo	Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Random races, algorithms, routing, traffic engineering, MPLS
18	Zhenjiang Li, J. J. Garcia-Luna-Aceves	Finding multi-constrained feasible paths by using depth-first search.	Wirel. Networks	2007	DBLP DOI BibTeX RDF	Multi-constrained path selection, Success ratio, Existence percentage, Competitive ratio, Depth-first search
18	Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok	A new particle swarm optimization based algorithm for solving shortest-paths tree problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
18	Mongkol Ekpanyapong, Xin Zhao 0001, Sung Kyu Lim	An Efficient Computation of Statistically Critical Sequential Paths Under Retiming.	ASP-DAC	2007	DBLP DOI BibTeX RDF
18	Gaëtan Mourmant, Mike Gallivan	How personality type influences decision paths in the unfolding model of voluntary job turnover: an application to IS professionals.	CPR	2007	DBLP DOI BibTeX RDF	Myers-Briggs personality type, Myers-Briggs type indicator (MBTI), job turnover, unfolding model of turnover
18	Nikolaos G. Bourbakis, Raj Patil	A Methodology for Automatically Detecting Texture Paths and Patterns in Images.	ICTAI (1)	2007	DBLP DOI BibTeX RDF
18	Virginia Vassilevska, Ryan Williams 0001, Raphael Yuster	All-pairs bottleneck paths for general graphs in truly sub-cubic time.	STOC	2007	DBLP DOI BibTeX RDF	bottleneck path, maximum capacity path, matrix multiplication, subcubic
18	I. Chen, Mabo Robert Ito	Relaxed Failure Recovery Process for Reliable Quality-of-Service using Unreserved Backup Paths.	AINA	2007	DBLP DOI BibTeX RDF
18	Matthieu Petit, Arnaud Gotlieb	Uniform Selection of Feasible Paths as a Stochastic Constraint Problem.	QSIC	2007	DBLP DOI BibTeX RDF
18	Danny Z. Chen, Ewa Misiolek	Finding Many Optimal Paths Without Growing Any Optimal Path Trees.	COCOON	2007	DBLP DOI BibTeX RDF
18	Janardhan R. Iyengar, Paul D. Amer, Randall R. Stewart	Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	load balancing, multipath, SCTP, load sharing, transport layer, end-to-end
18	Sudip Misra, B. John Oommen	An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	stochastic graphs, Routing, dynamic, learning automata, all pairs shortest path
18	Chi Hong Cheong, Man Hon Wong 0001	Mining Popular Paths in a Transportation Database System with Privacy Protection.	ICDE Workshops	2006	DBLP DOI BibTeX RDF
18	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
18	Nighat Yasmin	Incremental computation of shortest paths in semi-dynamic graphs using software components.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	semi-dynamic graphs, specification, shortest path, software component, incremental computation
18	Yu-Liang Chi, Hsun-Ming Lee	Building Conceptual Knowledge for Managing Learning Paths in e-Learning.	KSEM	2006	DBLP DOI BibTeX RDF	Ontology, Semantic, e-Learning, Conceptual structure
18	Krzysztof Walkowiak	A New Function for Optimization of Working Paths in Survivable MPLS Networks.	ISCIS	2006	DBLP DOI BibTeX RDF
18	Chao Peng, Hong Shen	An Improved Approximation Algorithm for Computing Disjoint QoS Paths.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
18	Yoshinori Kitatsuji, Satoshi Katsuno, Masato Tsuru, Tetsuya Takine, Yuji Oie	On Flow Distribution over Multiple Paths Based on Traffic Characteristics.	ICOIN	2006	DBLP DOI BibTeX RDF
18	Vlado Vorisek, Bruce Swanson, Kun-Han Tsai, Dhiraj Goswami	Improved Handling of False and Multicycle Paths in ATPG.	VTS	2006	DBLP DOI BibTeX RDF
18	Keiichi Kaneko, Shietung Peng	Disjoint Paths Routing in Pancake Graphs.	PDCAT	2006	DBLP DOI BibTeX RDF
18	Rezaul Alam Chowdhury, Vijaya Ramachandran	External-memory exact and approximate all-pairs shortest-paths in undirected graphs.	SODA	2005	DBLP BibTeX RDF
18	Carsten Maple, Jon Hitchcock	A Novel Scalable Parallel Algorithm for Finding Optimal Paths over Heterogeneous Terrain.	IV	2005	DBLP DOI BibTeX RDF
18	Annamária Kovács	Polynomial Time Preemptive Sum-Multicoloring on Paths.	ICALP	2005	DBLP DOI BibTeX RDF
18	Abhik Roychoudhury, Tulika Mitra, Hemendra Singh Negi	Analyzing Loop Paths for Execution Time Estimation.	ICDCIT	2005	DBLP DOI BibTeX RDF
18	Kazuhiro Kazama, Shin-ya Sato, Kensuke Fukuda, Ken-ichiro Murakami, Hiroshi Kawakami, Osamu Katai	Evaluation of Using Human Relationships on the Web as Information Navigation Paths.	JSAI Workshops	2005	DBLP DOI BibTeX RDF
18	Stephen Herborn	Building media overlay service paths.	CoNEXT	2005	DBLP DOI BibTeX RDF	media routing, context awareness, service composition
18	Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghem	The stability of paths in a dynamic network.	CoNEXT	2005	DBLP DOI BibTeX RDF	link weight perturbation, link-state update policy, quality of service, shortest path, network dynamics
18	Said Hoceini, Abdelhamid Mellouk, Yacine Amirat	K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks.	ICN (2)	2005	DBLP DOI BibTeX RDF
18	Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap	k-Link Shortest Paths in Weighted Subdivisions.	WADS	2005	DBLP DOI BibTeX RDF
18	Maarten Marx	First Order Paths in Ordered Trees.	ICDT	2005	DBLP DOI BibTeX RDF
18	M. Sabry Hassouna, Aly A. Farag, Robert Falk	Differential Fly-Throughs (DFT): A General Framework for Computing Flight Paths.	MICCAI	2005	DBLP DOI BibTeX RDF
18	Irit Katriel, Pascal Van Hentenryck	Maintaining Longest Paths in Cyclic Graphs.	CP	2005	DBLP DOI BibTeX RDF
18	Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic	Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.	CAAN	2004	DBLP DOI BibTeX RDF
18	Maren Martens, Martin Skutella	Flows on Few Paths: Algorithms and Lower Bounds.	ESA	2004	DBLP DOI BibTeX RDF
18	Mateu Sbert, Francesc Castro, John H. Halton	Reuse of Paths in Light Source Animation.	Computer Graphics International	2004	DBLP DOI BibTeX RDF
18	Joseph S. B. Mitchell, Micha Sharir	New results on shortest paths in three dimensions.	SCG	2004	DBLP DOI BibTeX RDF	shortest path, NP-hardness, motion planning, terrain
18	Zoé Lacroix, Louiqa Raschid, Maria-Esther Vidal	Efficient Techniques to Explore and Rank Paths in Life Science Data Sources.	DILS	2004	DBLP DOI BibTeX RDF
18	Abdulrahman H. Altalhi, Golden G. Richard III	Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks.	PerCom Workshops	2004	DBLP DOI BibTeX RDF
18	Jian Zhang 0001	Symbolic Execution of Program Paths Involving Pointer and Structure Variables.	QSIC	2004	DBLP DOI BibTeX RDF
18	Sergei Bespamyatnikh	Encoding Homotopy of Paths in the Plane.	LATIN	2004	DBLP DOI BibTeX RDF
18	Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac, David Van Campenhout	Reasoning with Temporal Logic on Truncated Paths.	CAV	2003	DBLP DOI BibTeX RDF
18	Víctor M. Jiménez, Andrés Marzal	A Lazy Version of Eppstein's K Shortest Paths Algorithm.	WEA	2003	DBLP DOI BibTeX RDF
18	Aleksandrs Slivkins	Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs.	ESA	2003	DBLP DOI BibTeX RDF
18	Mustapha Kchikech, Olivier Togni	Paths Coloring Algorithms in Mesh Networks.	DMTCS	2003	DBLP DOI BibTeX RDF
18	Dong Xiang, Shan Gu, Hideo Fujiwara	Non-Scan Design for Testability for Mixed RTL Circuits with Both Data Paths and Controller via Conflict Analysis.	Asian Test Symposium	2003	DBLP DOI BibTeX RDF
18	Gunyoung Koh, Duyoung Oh, Heekyoung Woo	A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks.	Human.Society@Internet 2003	2003	DBLP DOI BibTeX RDF
18	Ya-Hui Chang, Cheng-Ta Lee	Supporting Selection-Projection XQuery Processing Based on Encoding Paths.	DASFAA	2003	DBLP DOI BibTeX RDF
18	D. V. Sreenath, William I. Grosky, Farshad Fotouhi	Emergent Semantics from Users' Browsing Paths.	ISI	2003	DBLP DOI BibTeX RDF