|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1883 occurrences of 932 keywords
|
|
|
Results
Found 3801 publication records. Showing 3801 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
101 | László Babai |
On the diameter of Eulerian orientations of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 822-831, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
94 | Wen-Ting Wu, Jyh-Cheng Chen, Kai-Hsiu Chen, Kuo-Pao Fan |
Design and implementation of WIRE Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITRE ![In: ITRE 2005 - 3rd International Conference on Information Technology: Research and Education, June 27-30 2005, Hsinchu, Taiwan, Proceedings, pp. 428-433, 2005, IEEE, 0-7803-8933-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
85 | Dyi-Rong Duh, Gen-Huey Chen, Jywe-Fei Fang |
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(7), pp. 714-723, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
?-wide diameter, node-fault diameter, interconnection network, connectivity, embedding, routing algorithm, diameter, container, Broadcasting algorithm, Hamiltonian circuit |
84 | Hui-Ling Huang, Gen-Huey Chen |
Combinatorial Properties of Two-Level Hypernet Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(11), pp. 1192-1199, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Best container, hypernet network, container, graph-theoretic interconnection network, wide diameter, fault diameter |
75 | Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi |
Fault-diameter of the star-connected cycles interconnection network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 469-478, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
star-connected cycles interconnection network, maximum diameter, fault-free, fixed constant, fault tolerance, reliability, graph theory, parallel architectures, fault tolerant computing, graph, multiprocessor interconnection networks, vertex connectivity, fault-diameter |
74 | Khaled Day, Abdel Elah Al-Ayyoub |
Minimal Fault Diameter for Highly Resilient Product Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(9), pp. 926-930, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter |
68 | Kiyomi Sakamoto, Shoichi Aoyama, Shigeo Asahara, Haruki Mizushina, Hirohiko Kaneko |
Relationship between Emotional State and Pupil Diameter Variability under Various Types of Workload Stress. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (15) ![In: Ergonomics and Health Aspects of Work with Computers, International Conference, EHAWC 2009, Held as Part of HCI International 2009, San Diego, CA, USA, July 19-24, 2009. Proceedings, pp. 177-185, 2009, Springer, 978-3-642-02730-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Pupil diameter, audio stimuli, psychological state, variability in pupil diameter |
67 | Hervé Fournier, Antoine Vigneron |
Lower Bounds for Geometric Diameter Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 467-478, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope |
64 | Jun-Ming Xu 0001 |
Wide Diameters of Cartesian Product Graphs and Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(2), pp. 171-181, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fault tolerance, networks, connectivity, diameter, cartesian product, wide diameter |
61 | Clémence Magnien, Matthieu Latapy, Michel Habib |
Fast computation of empirically tight bounds for the diameter of massive graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Diameter bounds, graph diameter |
61 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Small Hop-diameter Sparse Spanners for Doubling Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(1), pp. 28-44, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hop diameter, Algorithms, Doubling metrics, Sparse spanners |
61 | Hervé Fournier, Antoine Vigneron |
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 49(3), pp. 245-257, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope |
61 | Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004 |
Computing Diameter in the Streaming and Sliding-Window Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(1), pp. 25-41, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Massive data streams, Diameter, Sliding window |
60 | Jason Baumgartner, Andreas Kuehlmann |
Enhanced Diameter Bounding via Structural. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2004 Design, Automation and Test in Europe Conference and Exposition (DATE 2004), 16-20 February 2004, Paris, France, pp. 36-41, 2004, IEEE Computer Society, 0-7695-2085-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
60 | Fedor V. Fomin, Martín Matamala, Ivan Rapaport |
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 211-222, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
54 | Rami G. Melhem |
Low Diameter Interconnections for Routing in High-Performance Parallel Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(4), pp. 502-510, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fixed diameter graphs, low diameter networks, Interconnection networks, directed graphs, circuit switching, deterministic routing |
54 | Dikran S. Meliksetian, C. Y. Roger Chen |
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(10), pp. 1172-1178, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
multiprocessor structure, exact network diameter, fault tolerant computing, hypercube networks, diameter, cube-connected cycles, performanceevaluation, optimal routing algorithm |
54 | Bayram Akdemir, Salih Günes, Bülent Oran |
Prediction of Aortic Diameter Values in Healthy Turkish Infants, Children and Adolescents Via Adaptive Network Based Fuzzy Inference System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 498-505, 2008, Springer, 978-3-540-87440-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Aortic Diameter, Line Base Normalization Method, Prediction, ANFIS |
54 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 96-106, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
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 |
53 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 779-794, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
53 | Yusuke Sasaki, Hiroyoshi Miwa |
A Control Method of a P2P Network with Small Degree and Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIS ![In: 7th International Conference on Hybrid Intelligent Systems, HIS 2007, Kaiserslautern, Germany, September 17-19, 2007, pp. 253-258, 2007, IEEE Computer Society, 0-7695-2946-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
53 | Hsun-Wen Chang, San-Yu Chen |
The 3-Wide-Diameter of the Hyper-L Triple-Loop Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan, pp. 552-557, 2006, IEEE Computer Society, 0-7695-2736-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Refael Hassin, Asaf Levin |
Minimum Restricted Diameter Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 175-184, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu |
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 169-179, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph |
48 | Konstantinos Georgiou, Periklis A. Papakonstantinou |
Complexity and Algorithms for Well-Structured k-SAT Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, pp. 105-118, 2008, Springer, 978-3-540-79718-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Jong-Seok Kim, Eunseuk Oh, Hyeong-Ok Lee, Yeong-Nam Heo |
Topological and Communication Aspects of Hyper-Star Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2003, 18th International Symposium, Antalya, Turkey, November 3-5, 2003, Proceedings, pp. 51-58, 2003, Springer, 3-540-20409-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Martin Gruber, Günther R. Raidl |
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 263-270, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded diameter minimum spanning tree, construction heuristics, greedy randomized search, local improvement, dynamic programming |
47 | Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis |
Fast and Simple Approximation of the Diameter and Radius of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings, pp. 98-108, 2006, Springer, 3-540-34597-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph diameter, graph algorithms, analysis of algorithms, algorithm engineering, approximation techniques |
47 | Khaled Day, Abdel Elah Al-Ayyoub |
Fault Diameter of k-ary n-cube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(9), pp. 903-907, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter |
47 | H. E. Escuardro, Felix P. Muga II |
Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 417-420, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
undirected, graph theory, digraph, de Bruijn graph, wide-diameter |
47 | Sing-Ban Tien, Cauligi S. Raghavendra |
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(6), pp. 713-718, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes |
46 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Small hop-diameter sparse spanners for doubling metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 70-78, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik |
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 292-305, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
46 | Hae Dong Lee, Byung Gil Lee, Hyung Gon Kim |
Design of Peer State Acquisition Mechanism for Efficient Dynamic HA Allocation at Diameter-Based AAA Server. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDMA International Conference ![In: Mobile Communications, 7th CDMA International Conference, CIC 2002, Seoul, Korea, October 29 - November 1, 2002, Revised Papers, pp. 403-412, 2002, Springer, 3-540-00732-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Sang Keun Yoo, Hyun Gon Kim, Seung Won Sohn |
Enhancement of Failover Using Application Layer Watchdog and SCTP Heartbeat in Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDMA International Conference ![In: Mobile Communications, 7th CDMA International Conference, CIC 2002, Seoul, Korea, October 29 - November 1, 2002, Revised Papers, pp. 239-246, 2002, Springer, 3-540-00732-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Sun Hwa Lim, Jung Mo Mun, Yeong Jin Kim, Sun Bae Lim |
Design of Protocol Conversion Gateway Based on Diameter for Interworking between Wireless LANs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDMA International Conference ![In: Mobile Communications, 7th CDMA International Conference, CIC 2002, Seoul, Korea, October 29 - November 1, 2002, Revised Papers, pp. 143-152, 2002, Springer, 3-540-00732-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Jing Huang 0007, Dong Ye 0002 |
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 353-361, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oriented diameter, proper interval graph, orientation, Diameter, interval graph |
43 | Behrooz Parhami, Mikhail A. Rakov |
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 714-724, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width |
43 | Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu |
Edge Congestion and Topological Properties of Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(1), pp. 64-80, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width |
42 | Silvio Lattanzi, D. Sivakumar 0001 |
Affiliation networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 427-434, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
densification, social networks, diameter, sparsification |
42 | Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes |
Asymptotically Optimal Solutions for Small World Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(4), pp. 632-650, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Oblivious diameter, Social networks, Small world graph |
42 | Charles U. Martel, Van Nguyen |
Analyzing Kleinberg's (and other) small-world Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 179-188, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
routing, random graphs, diameter, small-world network |
41 | Hyeong-Ok Lee, Jong-Seok Kim, Eunseuk Oh, Hyeong-Seok Lim |
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EurAsia-ICT ![In: EurAsia-ICT 2002: Information and Communication Technology, First EurAsian Conference, Shiraz, Iran, October 29-31, 2002, Proceedings, pp. 858-865, 2002, Springer, 3-540-00028-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Ying Gao, Armando Barreto, Malek Adjouadi |
Monitoring and Processing of the Pupil Diameter Signal for Affective Assessment of a Computer User. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (1) ![In: Human-Computer Interaction. New Trends, 13th International Conference, HCI International 2009, San Diego, CA, USA, July 19-24, 2009, Proceedings, Part I, pp. 49-58, 2009, Springer, 978-3-642-02573-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Pupil diameter (PD), Pupillary light reflex (PLR), Pupillary affective response (PAR), Adaptive Interference Canceller (AIC), H??? time-varying (HITV) adaptive algorithm |
40 | Yu. G. Nikonorov, Y. V. Nikonorova |
The Intrinsic Diameter of the Surface of a Parallelepiped. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(4), pp. 504-527, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Convex surface, Rectangular parallelepiped, Intrinsic distance, Intrinsic diameter, Surface area |
40 | Armando Barreto, Ying Gao, Malek Adjouadi |
Pupil diameter measurements: untapped potential to enhance computer interaction for eye tracker users? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASSETS ![In: Proceedings of the 10th International ACM SIGACCESS Conference on Computers and Accessibility, ASSETS 2008, Halifax, Nova Scotia, Canada, October 13-15, 2008, pp. 269-270, 2008, ACM, 978-1-59593-976-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
pupil diameter, stress, frustration, eye gaze tracking |
40 | Alok Singh 0001, Ashok Kumar Gupta |
Improved heuristics for the bounded-diameter minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(10), pp. 911-921, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm |
40 | Iztok Banic, Janez Zerovnik |
Edge Fault-Diameter of Cartesian Product of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pp. 234-245, 2007, Springer, 978-3-540-72918-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cartesian graph products, edge fault-diameter, interconnection network |
40 | Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo |
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 146(1), pp. 19-39, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Diameter constrained trees, Hop-indexed models, Network flows |
40 | Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès |
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(2), pp. 209-226, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Augmentation problem, Approximation algorithms, Dynamical programming, Diameter, Partial covering |
40 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal 0001, Jack Snoeyink |
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(4), pp. 577-589, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimum diameter spanning tree, Approximation algorithm, Geometric graph |
40 | Ming-Chun Tsai, Hung-Lin Fu |
Edge Number of 3-Connected Diameter 3 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 364-367, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
decay number, edge number, connectivity, diameter |
40 | Victor Chepoi, Yann Vaxès |
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(2), pp. 243-262, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Biconnectivity augmentation, Approximation algorithms, Trees, Diameter, Radius |
40 | Hans-Christoph Wirth, Jan Steffan |
On Minimum Diameter Spanning Trees under Reload Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 78-88, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Node weighted graphs, Network Design, Spanning Tree, Diameter, Transportation problems |
39 | Bin Fu, Zhiyu Zhao |
Separating Sublinear Time Computations by Approximate Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 79-88, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder |
Strong-diameter decompositions of minor free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 16-24, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minor free graphs, compact routing |
39 | Zvi Lotker, Boaz Patt-Shamir, David Peleg |
Distributed MST for constant diameter graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(6), pp. 453-460, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimum-weight spanning tree, Distributed algorithm |
39 | Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko |
Computing the Diameter of 17-Pancake Graph Using a PC Cluster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 1114-1124, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Duncan E. Donohue, Giorgio A. Ascoli |
Local Diameter Fully Constrains Dendritic Size in Basal but not Apical Trees of CA1 Pyramidal Neurons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Neurosci. ![In: J. Comput. Neurosci. 19(2), pp. 223-238, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dendritic structure, pyramidal cells, computational models, morphology, three-dimensional reconstructions |
39 | Roberto Accorsi, Scott D. Metzler |
Analytic determination of the resolution-equivalent effective diameter of a pinhole collimator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 23(6), pp. 750-763, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Jun (Jim) Xu, Abhishek Kumar 0003, Xingxing Yu |
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 22(1), pp. 151-163, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Sariel Har-Peled |
A practical approach for computing the diameter of a point set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 177-186, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Zvi Lotker, Boaz Patt-Shamir, David Peleg |
Distributed MST for constant diameter graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 63-71, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Joseph O'Rourke, Catherine A. Schevon |
Computing the Geodesic Diameter of a 3-Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pp. 370-379, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
39 | Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang |
Bounded-Diameter Minimum Spanning Trees and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pp. 276-282, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
35 | Jianqin Zhou, Wenjuan Wang |
On Constructions of Optimal Double-Loop Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 766-774, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
tight optimal, L-shaped tile, algorithm, Diameter, double-loop network |
35 | Dmitri Loguinov, Juan Casas, Xiaoming Wang 0002 |
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(5), pp. 1107-1120, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
De Bruijn graphs, diameter-degree tradeoff, peer-to-peer networks |
35 | Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau |
Routing Algorithms on the Bus-Based Hypercube Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(4), pp. 335-348, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Multiple-bus network, fault tolerance, hypercube, routing algorithm, diameter |
35 | Behrooz Parhami, Mikhail A. Rakov |
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 725-736, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperstar, robust network, fault tolerance, scalability, interconnection network, routing algorithm, emulation, Bipartite graph, diameter, permutation routing, chordal ring |
35 | Bao-Xing Chen, Wenjun Xiao |
Optimal Designs of Directed Double-Loop Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004, Proceedings, pp. 19-24, 2004, Springer, 3-540-24127-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
directed double-loop networks, k-tight optimal, diameter, optimal design |
35 | Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes |
Hierarchical Ring Network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(6), pp. 663-682, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Combinatorial Optimization, Network Design, Diameter, Ring Networks |
35 | Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes |
Directed Virtual Path Layouts in ATM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998, Proceedings, pp. 75-88, 1998, Springer, 3-540-65066-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Virtual path layout, ATM, Embedding, diameter |
34 | Suleman Surti, Joel S. Karp, Lucretiu M. Popescu, Margaret E. Daube-Witherspoon, Matthew E. Werner |
Investigation of time-of-flight benefit for fully 3-DPET. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 25(5), pp. 529-538, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Dongsheng Li 0001, Xicheng Lu, Jie Wu 0001 |
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA, pp. 1677-1688, 2005, IEEE, 0-7803-8968-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano |
Computing the Diameters of 14- and 15-Pancake Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA, pp. 490-495, 2005, IEEE Computer Society, 0-7695-2509-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Reza Mohammadi 0004, Warren H. Finlay, Wilson H.-Y. Roa, Alidad Amirfazli |
Determination of Contact Angle of Microspheres by Microscopy Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMENS ![In: 2003 International Conference on MEMS, NANO, and Smart Systems (ICMENS 2003), 20-23 July 2003, Banff, Alberta, Canada, pp. 84-88, 2003, IEEE Computer Society, 0-7695-1947-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Sanguthevar Rajasekaran, Thanasis Tsantilas |
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings, pp. 226-241, 1987, Springer, 3-540-18625-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Ye Xu, Zhuo Wang 0004, Wenbo Zhang |
On Traveling Diameter of an Instance of Complex Networks - Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 90-99, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Internet traveling diameter, chaos, GA, Logistic Model, correlation dimension |
33 | Fangqing Gu, Hai-Lin Liu 0001, Wei Liu |
A bounded diameter minimum spanning tree evolutionary algorithm based on double chromosome. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 157-162, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
double chromosome, the bounded diameter minimum spanning tree, evolutionary algorithm, local search |
33 | Huynh Thi Thanh Binh, Robert I. McKay, Nguyen Xuan Hoai, Nguyen Duc Nghia |
New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 373-380, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded diameter minimum spanning tree, heuristic algorithm, hybrid genetic algorithm, multi-parent crossover |
33 | Ning Zhang, Incheol Shin, Feng Zou, Weili Wu 0001, My T. Thai |
Trade-off scheme for fault tolerant connected dominating sets on size and diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOWANC ![In: Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, FOWANC 2008, Hong Kong, SAR, China, May 26, 2008, pp. 1-8, 2008, ACM, 978-1-60558-149-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded diameter, fault tolerance, wireless ad-hoc networks, connected dominating set |
33 | Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abdullah-Al-Wadud, Oksam Chae |
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 58-69, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Boolean Matrix, Graph Diameter, Computational Complexity, Random Graphs, Adjacency Matrix |
33 | Matthew O. Jackson |
Average Distance, Diameter, and Clustering in Social Networks with Homophily. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 4-11, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Segregation, Clustering, Social Networks, Networks, Random Graphs, Diameter, Friendships, Average Distance, Homophily |
33 | Martin Gruber, Günther R. Raidl |
Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAINT ![In: Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, 28 July - 1 August 2008, Turku, Finland, pp. 261-264, 2008, IEEE Computer Society, 978-0-7695-3297-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded diameter minimum spanning tree, local search, tabu search, branch-and-cut |
33 | Xingde Jia |
Wide Diameter of Cayley Digraphs of Finite Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 146-150, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cayley digraphs, communication networks, wide diameter, geometric representation |
33 | Qunfang Hu, Hongwei Huang |
Numerical Analysis and Risk Assessment on Face Stability of Large-Diameter Tunnels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 1180-1187, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
face stability, large-diameter tunnel, risk assessment, numerical analysis |
33 | Martin Gruber, Jano I. van Hemert, Günther R. Raidl |
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 1187-1194, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded diameter minimum spanning tree problem, variable neighbourhood search, evolutionary computation, ant colony optimisation |
33 | Mirela Damian, Sriram V. Pemmaraju |
Computing Optimal Diameter-Bounded Polygon Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 1-14, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Diameter-bounded, Approximation algorithm, Polygon decomposition |
33 | Nak-Keun Joo, Hyeong-Seok Lim |
A new interconnection network for parallel computer with low diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 540-547, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
low diameter, graycube, dialation 2, hypercube embedding, routing, parallel computer, interconnection network, hypercube networks, broadcasting algorithms, recursive structure |
33 | L. R. Nochefranca, P. W. Sy |
The diameter of the generalized de Bruijn graph UGB(n, n(n2+1)). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 421-423, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
generalized de Bruijn graph, graph theory, diameter, de Bruijn graph |
33 | Jaime D. L. Caro, Luz R. Nochefranca, Polly W. Sy, Felix P. Muga II |
The wide-diameter of the generalized de Bruijn graphs UGB(n, n(n+1)). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 334-336, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
generalized de Bruijn graphs, graph theory, de Bruijn graphs, wide-diameter |
32 | Dae-Young Seo, D. T. Lee, Tien-Ching Lin |
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 283-292, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci |
On the Expansion and Diameter of Bluetooth-Like Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 528-539, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Martin Gruber, Günther R. Raidl |
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference, Las Palmas de Gran Canaria, Spain, February 15-20, 2009, Revised Selected Papers, pp. 665-672, 2009, Springer, 978-3-642-04771-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Rui Yang, Shijie Zhou, Chengyu Fan |
A New Algorithm for Network Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 247-252, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Alauddin Bhuiyan, Baikunth Nath, Joselíto J. Chua, Kotagiri Ramamohanarao |
Vessel Cross-Sectional Diameter Measurement on Color Retinal Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIOSTEC (Selected Papers) ![In: Biomedical Engineering Systems and Technologies, International Joint Conference, BIOSTEC 2008, Funchal, Madeira, Portugal, January 28-31, 2008, Revised Selected Papers, pp. 214-227, 2008, Springer, 978-3-540-92218-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Vessel Cross-section, Adaptive Region Growing Technique, Gabor Energy Filter Bank, Texture Classification, Fuzzy C-Means Clustering, Gradient Operator |
32 | Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz |
Multicast Tree Diameter for Dynamic Distributed Interactive Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 1597-1605, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Vincenzo Gemignani, Francesco Faita, Lorenzo Ghiadoni, Elisa Poggianti, Marcello Demi |
A System for Real-Time Measurement of the Brachial Artery Diameter in B-Mode Ultrasound Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 26(3), pp. 393-404, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Rajib K. Das |
Diameter and Routing in Enhanced OTIS Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCTA ![In: 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 5-7 March 2007, Kolkata, India, pp. 188-192, 2007, IEEE Computer Society, 978-0-7695-2770-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Augustin Chaintreau, Abderrahmen Mtibaa, Laurent Massoulié, Christophe Diot |
The diameter of opportunistic mobile networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2007, New York, NY, USA, December 10-13, 2007, pp. 12, 2007, ACM, 978-1-59593-770-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3801 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|