Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
99 | Gruia Calinescu, Peng-Jun Wan |
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(2), pp. 121-128, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, distributed algorithm, NP-hardness, topology control, power assignment |
87 | Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 723-760, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
2-edge connectivity, connectivity, minimum spanning tree, dynamic graph algorithms, Biconnectivity |
80 | Monika Rauch Henzinger, Johannes A. La Poutré |
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 171-184, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
75 | Gruia Calinescu, Peng-Jun Wan |
Range Assignment for High Connectivity in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, ADHOC-NOW 2003 Montreal, Canada, October 8-10, 2003, Proceedings, pp. 235-246, 2003, Springer, 3-540-20260-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
69 | Art Kazmierczak, Sridhar Radhakrishnan |
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(2), pp. 110-118, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
biconnectivity testing, outerplanarity testing, Distributed algorithm, message complexity, depth first search, ear decomposition |
62 | Carsten Gutwenger, Petra Mutzel, Bernd Zey |
Planar Biconnectivity Augmentation with Fixed Embedding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 289-300, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Ye Tian, Min Sheng, Jiandong Li 0001, Yan Zhang 0006, Junliang Yao |
Critical Transmitting Range for Biconnectivity of One-Dimensional Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 67th IEEE Vehicular Technology Conference, VTC Spring 2008, 11-14 May 2008, Singapore, pp. 108-112, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
62 | Ivana Ljubic, Günther R. Raidl, Jozef Kratica |
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN VI, 6th International Conference, Paris, France, September 18-20, 2000, Proceedings, pp. 641-650, 2000, Springer, 3-540-41056-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
56 | Jiong Guo, Johannes Uhlmann |
Kernelization and Complexity Results for Connectivity Augmentation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 483-494, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Petra Mutzel |
A Polyhedral Approach to Planar Augmentation and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 494-507, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
50 | Peng-Jun Wan, Chih-Wei Yi |
Max-Life Power Schedule for Connectivity and Biconnectivity in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 10(6), pp. 997-1004, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
power schedule, connectivity, wireless ad hoc networks, power assignment, biconnectivity |
50 | 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 |
50 | Monika Rauch Henzinger, Valerie King |
Fully Dynamic Biconnectivity and Transitive Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 664-672, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory |
50 | Samir Khuller, Uzi Vishkin |
Biconnectivity Approximations and Graph Carvings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 214-235, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
sparse subgraphs, connectivity, biconnectivity |
50 | Monika Rauch |
Fully Dynamic Biconnectivity in Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 50-59, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
query time, dynamic biconnectivity, edge insertions, linear storage, amortized running time, planar embedded graph, graphs, time complexity, deletions |
49 | Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu 0001 |
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 396(1-3), pp. 180-190, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Keqin Li |
Topological Characteristics of Random Multihop Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 8(2-3), pp. 119-126, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
connectivity, bandwidth, diameter, multihop wireless network, communication latency, random network, biconnectivity |
43 | Carsten Gutwenger, Petra Mutzel, Bernd Zey |
On the Hardness and Approximability of Planar Biconnectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 249-257, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Prithwish Basu, Jason Redi |
Movement control algorithms for realization of fault-tolerant ad hoc robot networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Netw. ![In: IEEE Netw. 18(4), pp. 36-44, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Artur Czumaj, Andrzej Lingas |
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 856-868, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Zvi Galil, Giuseppe F. Italiano, Neil Sarnak |
Fully Dynamic Planarity Testing with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(1), pp. 28-91, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
planarity testing, planar graphs, dynamic graph algorithms |
26 | Bin Hu 0004, Günther R. Raidl |
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIS (3) ![In: 9th International Conference on Hybrid Intelligent Systems (HIS 2009), August 12-14, 2009, Shenyang, China, pp. 63-68, 2009, IEEE Computer Society, 978-0-7695-3745-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Network Design, Memetic Algorithm, Biconnectivity |
24 | Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001 |
Provably Fast and Space-Efficient Parallel Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.01356, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Bohang Zhang, Shengjie Luo, Liwei Wang 0001, Di He 0001 |
Rethinking the Expressive Power of GNNs via Graph Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.09505, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001 |
Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
HOPC@SPAA ![In: Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, HOPC 2023, Orlando, FL, USA, 16 June 2023, pp. 5-6, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Jacob Holm, Ivor van der Hoog, Eva Rotenberg |
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, pp. 40:1-40:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-273-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001 |
Provably Fast and Space-Efficient Parallel Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023, Montreal, QC, Canada, 25 February 2023 - 1 March 2023, pp. 52-65, 2023, ACM, 979-8-4007-0015-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Bohang Zhang, Shengjie Luo, Liwei Wang 0001, Di He 0001 |
Rethinking the Expressive Power of GNNs via Graph Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
24 | Ian Bogle, George M. Slota |
Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: IEEE International Parallel and Distributed Processing Symposium, IPDPS Workshops 2022, Lyon, France, May 30 - June 3, 2022, pp. 1139-1142, 2022, IEEE, 978-1-6654-9747-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Ian Bogle, George M. Slota |
Achieving Speedups for Distributed Graph Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPEC ![In: IEEE High Performance Extreme Computing Conference, HPEC 2022, Waltham, MA, USA, September 19-23, 2022, pp. 1-7, 2022, IEEE, 978-1-6654-9786-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Jacob Holm, Eva Rotenberg |
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 42:1-42:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Guangyao Shi, Ishat E. Rabban, Pratap Tokekar |
Fast Biconnectivity Restoration in Multi-Robot Systems for Robust Communication Maintenance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.00685, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
24 | Jacob Holm, Eva Rotenberg |
Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.02568, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
24 | Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti |
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 90, pp. 63-79, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Mehran Zareh, Lorenzo Sabattini, Cristian Secchi |
Decentralized Biconnectivity Conditions in Multi-robot Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.02276, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti |
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.08645, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Mehran Zareh, Lorenzo Sabattini, Cristian Secchi |
Enforcing Biconnectivity in Multi-robot Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.02286, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti |
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, pp. 22:1-22:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-026-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Mehran Zareh, Lorenzo Sabattini, Cristian Secchi |
Decentralized biconnectivity conditions in multi-robot systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 55th IEEE Conference on Decision and Control, CDC 2016, Las Vegas, NV, USA, December 12-14, 2016, pp. 99-104, 2016, IEEE, 978-1-5090-1837-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Mehran Zareh, Lorenzo Sabattini, Cristian Secchi |
Enforcing biconnectivity in multi-robot systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 55th IEEE Conference on Decision and Control, CDC 2016, Las Vegas, NV, USA, December 12-14, 2016, pp. 1800-1805, 2016, IEEE, 978-1-5090-1837-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Giuseppe Chiapparo, Umberto Ferraro Petrillo, Donatella Firmani, Luigi Laura |
Biconnectivity of Social and Web Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEBD ![In: 24th Italian Symposium on Advanced Database Systems, SEBD 2016, Ugento, Lecce, Italy, June 19-22, 2016, Ugento, Lecce, Italia, June 19-22, 2016., pp. 54-65, 2016, Matematicamente.it, 9788896354889. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Surabhi Jain, N. Sadagopan |
Simpler Sequential and Parallel Biconnectivity Augmentation in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 25(4), pp. 1550010:1-1550010:15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | George M. Slota, Kamesh Madduri |
Simple parallel biconnectivity algorithms for multicore platforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: 21st International Conference on High Performance Computing, HiPC 2014, Goa, India, December 17-20, 2014, pp. 1-10, 2014, IEEE Computer Society, 978-1-4799-5976-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Renato E. N. Moraes, Celso C. Ribeiro |
Power optimization in ad hoc wireless network topology control with biconnectivity requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 40(12), pp. 3188-3196, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Surabhi Jain, N. Sadagopan |
Simpler Sequential and Parallel Biconnectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.1772, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | James Alexander Edwards, Uzi Vishkin |
Better speedups using simpler parallel programming for graph connectivity and biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PMAM ![In: Proceedings of the 2012 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, PMAM 2012, New Orleans, LA, USA, February 26, 2012, pp. 103-114, 2012, ACM, 978-1-4503-1211-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
24 | N. S. Narayanaswamy, N. Sadagopan |
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011, pp. 45-54, 2011, Australian Computer Society, 978-1-920682-98-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Ivana Ljubic |
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 56(3), pp. 169-182, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu 0001 |
On dual power assignment optimization for biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 19(2), pp. 174-183, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Yukihide Kohira, Suguru Suehiro, Atsushi Takahashi 0001 |
A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(12), pp. 2971-2978, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Yukihide Kohira, Suguru Suehiro, Atsushi Takahashi 0001 |
A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 14th Asia South Pacific Design Automation Conference, ASP-DAC 2009, Yokohama, Japan, January 19-22, 2009, pp. 600-605, 2009, IEEE, 978-1-4244-2748-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Giorgio Ausiello, Donatella Firmani, Luigi Laura |
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings., pp. 26-29, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
24 | Bratislav Milic |
Distributed biconnectivity testing in Wireless multi-hop networks. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
24 | Christian Minge, Rong Zhao, Mathias Schweigel |
Improved Optical Network Topology Redesign Ensuring Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICT ![In: The Fourth Advanced International Conference on Telecommunications, AICT 2008, 8-13 June 2008, Athens, Greece, pp. 398-403, 2008, IEEE Computer Society, 978-0-7695-3162-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Yung H. Tsin |
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 102(1), pp. 27-34, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | David Pritchard |
An Optimal Distributed Edge-Biconnectivity Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0602013, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
24 | Mazda Ahmadi, Peter Stone |
A Distributed Biconnectivity Check. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DARS ![In: Distributed Autonomous Robotic Systems 7, Proceedings of the 8th International Symposium on Distributed Autonomous Robotic Systems, DARS 2006, Minneapolis, Minnesota, USA, 2006, pp. 1-10, 2006, Springer, 978-4-431-35878-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Tsan-sheng Hsu, Ming-Yang Kao |
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 19(2), pp. 345-362, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Ivana Ljubic, Günther R. Raidl |
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 9(5), pp. 401-427, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Raffaella Gentilini, Alberto Policriti |
Biconnectivity on Symbolically Represented Graphs: A Linear Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 554-564, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | T. M. Rao, Raghuveer M. Rao, Ferat Sahin, Jason C. Tillett |
Evolutionary algorithms for the edge biconnectivity augmentation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: Washington, D.C., USA, 5-8 October 2003, pp. 1955-1960, 2003, IEEE, 0-7803-7952-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Günther R. Raidl, Ivana Ljubic |
Evolutionary local search for the edge-biconnectivity augmentation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 82(1), pp. 39-45, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Tsan-sheng Hsu |
Simpler and faster biconnectivity augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 45(1), pp. 55-71, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Sandor Kersting, Günther R. Raidl, Ivana Ljubic |
A Memetic Algorithm for Vertex-Biconnectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, pp. 102-111, 2002, Springer, 3-540-43432-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Tsan-sheng Hsu, Ming-Yang Kao |
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.DS/0102009, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
24 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 37(3), pp. 144-155, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Ivana Ljubic, Günther R. Raidl |
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings, pp. 20-29, 2001, Springer, 3-540-41920-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Monika Rauch Henzinger |
Improved Data Structures for Fully Dynamic Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 29(6), pp. 1761-1815, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Ivana D. Ljubic, Jozef J. Kratica |
A genetic algorithm for the biconnectivity augmentation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, La Jolla, CA, USA, July 16-19, 2000., pp. 89-96, 2000, IEEE, 0-7803-6375-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Ka Wong Chong, Tak Wah Lam |
Approximating Biconnectivity in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 21(4), pp. 395-410, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Tsan-sheng Hsu, Ming-Yang Kao |
A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 2(3), pp. 237-256, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 79-89, 1998, ACM, 0-89791-962-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Ka Wong Chong, Tak Wah Lam |
Towards More Precise Parallel Biconnectivity Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 223-232, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Ka Wong Chong, Tak Wah Lam |
Improving Biconnectivity Approximation via Local Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA., pp. 26-35, 1996, ACM/SIAM, 0-89871-366-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Monika Rauch Henzinger |
Fully Dynamic Biconnectivity in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 13(6), pp. 503-538, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Ka Wong Chong, Tak Wah Lam |
Approximating Biconnectivity in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '95, Santa Barbara, California, USA, July 17-19, 1995, pp. 224-233, 1995, ACM, 0-89791-717-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Monika Rauch |
Improved data structures for fully dynamic biconnectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 686-695, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Art Kazmierczak, Sridhar Radhakrishnan |
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, SPDP 1993, Dallas, Texas, USA, December 2-5, 1993., pp. 486-489, 1993, IEEE Computer Society, 0-8186-4221-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
24 | Samir Khuller, Uzi Vishkin |
Biconnectivity Approximations and Graph Carvings ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 759-770, 1992, ACM, 0-89791-511-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Shing-Tsaan Huang |
A New Distributed Algorithm for the Biconnectivity Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the International Conference on Parallel Processing, ICPP '89, The Pennsylvania State University, University Park, PA, USA, August 1989. Volume 3: Algorithms and Applications., pp. 106-113, 1989, Pennsylvania State University Press. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP BibTeX RDF |
|
24 | Peter J. Varman, Kshitij A. Doshi |
Determining Biconnectivity on a Systolic Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: International Conference on Parallel Processing, ICPP'87, University Park, PA, USA, August 1987., pp. 848-850, 1987, Pennsylvania State University Press. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP BibTeX RDF |
|
24 | Robert Endre Tarjan, Uzi Vishkin |
An Efficient Parallel Biconnectivity Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 14(4), pp. 862-874, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Yung H. Tsin |
Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: International Conference on Parallel Processing, ICPP'83, Columbus, Ohio, USA, August 1983, pp. 180-182, 1983, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP BibTeX RDF |
|
24 | Greg N. Frederickson, Joseph F. JáJá |
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 19, pp. 189-201, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
19 | Satyajayant Misra, Seung Don Hong, Guoliang Xue, Jian Tang 0008 |
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements. ![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. 281-285, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Maurizio Pizzonia |
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 397-408, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | A. Volgenant, C. W. Duin |
On Steiner Versions of (bi)Connectivity in Network Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(2), pp. 263-273, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Bottleneck optimization, Steiner (bi)connectivity, Steiner bipartition, Algorithms, Combinatorial problems |
19 | Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele |
A new algorithm for normal dominance constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 59-67, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
19 | John H. Reif, William L. Scherlis |
Deriving Effcient Graph Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Verification: Theory and Practice ![In: Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, pp. 645-681, 2003, Springer, 3-540-21002-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Keqin Li |
Topological Characteristics of Random Multihop Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 19-22 May 2003, Providence, RI, USA, pp. 685-690, 2003, IEEE Computer Society, 0-7695-1921-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Weifa Liang, Richard P. Brent, Hong Shen |
Fully Dynamic Maintenance of k-Connectivity in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(8), pp. 846-864, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms |
19 | Mikkel Thorup, David R. Karger |
Dynamic Graph Algorithms with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 1-9, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Janet M. Six, Ioannis G. Tollis |
A Framework for Circular Drawings of Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 107-116, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Zhigang Qin, Felix F. Wu, Nathan Law |
Designing B-ISDN Network Topologies Using The Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: MASCOTS 1997, Proceedings of the Fifth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, January 12-15, 1997 Haifa, Israel, pp. 140-145, 1997, IEEE Computer Society, 0-8186-7758-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song |
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 390-400, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan |
Computing Minimal Spanning Subgraphs in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 146-156, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|