tanderson's library 69 articles Export

	Improved algorithms for graph four-connectivity [My Copy] J. Comput. Syst. Sci., Vol. 42, No. 3. (1991), pp. 288-306. by Arkady Kanevsky, Vijaya Ramachandran posted to no-tag by tanderson on 2009-10-06 03:47:46 as
	The Planar Hamiltonian Circuit Problem is NP-Complete [My Copy] SIAM Journal on Computing, Vol. 5, No. 4. (1976), pp. 704-714. by M. R. Garey, D. S. Johnson, R. Endre Tarjan posted to no-tag by tanderson on 2009-09-22 02:05:13 as
	On Triangulating Planar Graphs under the Four-Connectivity Constraint [My Copy] Algorithmica, Vol. 19, No. 4. (21 December 1997), pp. 427-446. by T. Biedl, G. Kant, M. Kaufmann posted to no-tag by tanderson on 2009-08-03 04:30:11 as
	Planarizing graphs --- a survey and annotated bibliography [My Copy] Journal of Graph Algorithms and Applications, Vol. 5, No. 1. (2001), pp. 1-74. by Annegret Liebers posted to no-tag by tanderson on 2009-08-03 04:24:21 as
	Drawing Planar Graphs Using the Canonical Ordering [My Copy] (October 1992) by Goos Kant posted to no-tag by tanderson on 2009-08-03 04:18:32 as
	The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems [My Copy] J. ACM, Vol. 26, No. 4. (1979), pp. 618-630. by Mihalis Yannakakis posted to no-tag by tanderson on 2009-08-03 04:11:44 as
	A better approximation algorithm for finding planar subgraphs [My Copy] In SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (1996), pp. 16-25. by Gruia Călinescu, Cristina G. Fernandes, Ulrich Finkler, Howard Karloff posted to no-tag by tanderson on 2009-08-03 04:10:03 as
	Arboricity and Bipartite Subgraph Listing Algorithms [My Copy] (24 February 1994) by David Eppstein posted to no-tag by tanderson on 2009-08-03 03:56:19 as
	Connectivity, Graph Minors, and Subgraph Multiplicity [My Copy] (10 January 1992) by David Eppstein posted to no-tag by tanderson on 2009-08-03 03:53:58 as
	Planar Drawings of Origami Polyhedra [My Copy] Graph Drawing (1998), pp. 438-440. by Erik Demaine, Martin Demaine posted to no-tag by tanderson on 2009-08-03 03:42:51 as
	Straight Skeletons of Three-Dimensional Polyhedra [My Copy] Algorithms - ESA 2008 (2008), pp. 148-160. by Gill Barequet, David Eppstein, Michael Goodrich, Amir Vaxman posted to no-tag by tanderson on 2009-08-03 03:40:10 as
	Iterated nearest neighbors and finding minimal polytypes [My Copy] In SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms (1993), pp. 64-73. by David Eppstein, Jeff Erickson posted to no-tag by tanderson on 2009-08-03 03:38:42 as
	New algorithms for minimum area <italic>k</italic>-gons [My Copy] In SODA '92: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992), pp. 83-88. by David Eppstein posted to no-tag by tanderson on 2009-08-03 03:36:55 as
	Separator-Based Sparsification II: Edge and Vertex Connectivity [My Copy] SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 341-381. by David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer posted to no-tag by tanderson on 2009-08-03 03:35:10 as
	Maintenance of a minimum spanning forest in a dynamic planar graph [My Copy] In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms (1990), pp. 1-11. by David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert E. Tarjan, Jeffery Westbrook, Moti Yung posted to no-tag by tanderson on 2009-08-03 03:33:45 as
	Subgraph isomorphism in planar graphs and related problems [My Copy] In SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms (1995), pp. 632-640. by David Eppstein posted to no-tag by tanderson on 2009-08-03 03:32:26 as
	Planar graph augmentation problems [My Copy] Algorithms and Data Structures (1991), pp. 286-298. by Goos Kant, Hans Bodlaender posted to no-tag by tanderson on 2009-07-27 03:33:47 as
	Fixed-Parameter Tractability for Non-Crossing Spanning Trees [My Copy] Algorithms and Data Structures (2007), pp. 410-421. by Magnús Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama posted to no-tag by tanderson on 2009-07-27 01:45:15 as
	Noncrossing Subgraphs in Topological Layouts [My Copy] SIAM Journal on Discrete Mathematics, Vol. 4, No. 2. (1991), pp. 223-244. by Jan Kratochv'il, Anna Lubiw, Jaroslav Nešetřil posted to no-tag by tanderson on 2009-07-27 01:44:07 as
	Long non-crossing configurations in the plane [My Copy] In SCG '93: Proceedings of the ninth annual symposium on Computational geometry (1993), pp. 257-263. by Noga Alon, Sridhar Rajagopalan, Subhash Suri posted to no-tag by tanderson on 2009-07-27 01:42:49 as
	The polyhedral approach to the maximum planar subgraph problem: New chances for related problems [My Copy] Graph Drawing (1995), pp. 119-130. by Michael Jünger, Petra Mutzel posted to no-tag by tanderson on 2009-07-19 08:42:37 as
	A polyhedral approach to planar augmentation and related problems [My Copy] Algorithms — ESA '95 (1995), pp. 494-507. by Petra Mutzel posted to no-tag by tanderson on 2009-07-19 08:41:36 as
	Algorithms for Planar Graph Augmentation [My Copy] (2008) by Bernd T. Zey posted to no-tag by tanderson on 2009-07-19 08:29:51 as
	The complexity of detecting crossingfree configurations in the plane [My Copy] BIT Numerical Mathematics, Vol. 33, No. 4. (1 December 1993), pp. 580-595. by Klaus Jansen, Gerhard J. Woeginger posted to no-tag by tanderson on 2009-07-19 08:24:20 as
	On the Hardness and Approximability of Planar Biconnectivity Augmentation [My Copy] Computing and Combinatorics (2009), pp. 249-257. by Carsten Gutwenger, Petra Mutzel, Bernd Zey posted to no-tag by tanderson on 2009-07-19 08:18:03 as
	Efficient Enumeration of Regular Languages [My Copy] Implementation and Application of Automata (2007), pp. 226-242. by Margareta Ackerman, Jeffrey Shallit posted to no-tag by tanderson on 2009-07-19 08:16:36 as
	Three New Algorithms for Regular Language Enumeration [My Copy] Computing and Combinatorics (2009), pp. 178-191. by Margareta Ackerman, Erkki Mäkinen posted to no-tag by tanderson on 2009-07-19 08:13:22 as
	On the NP-hardness of edge-deletion and -contraction problems [My Copy] Discrete Applied Mathematics, Vol. 6, No. 1. (May 1983), pp. 63-78. by Toshimasaa Watanabe, Tadashia Ae, Akiraa Nakamura posted to no-tag by tanderson on 2009-07-11 01:47:21 as
	Computers and Intractability : A Guide to the Theory of NP-Completeness [My Copy] (15 January 1979) by M. R. Garey, D. S. Johnson posted to no-tag by tanderson on 2009-07-11 01:35:17 as along with 17 people frimjon NitinCR dcordeiro pverstra gale82 creswick greenw ima danielaugot chechetka lcigler fdr eporreca Fin payton345 djlin tkollar
	Graph Theory [My Copy] Vol. 173 (2006) by Reinhard Diestel edited by S. Axler, K. A. Ribet posted to no-tag by tanderson on 2009-07-11 01:33:02 as
	Graph Theory [My Copy] Vol. 21 (1984) by W. T. Tutte edited by Gian-Carlo Rota posted to no-tag by tanderson on 2009-07-11 01:28:52 as
	On the deletion of nonplanar edges of a graph [My Copy] In Proc. of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing (1979), pp. 727-738. by P. C. Liu, R. C. Geldmacher posted to no-tag by tanderson on 2009-07-11 01:24:43 as
	On maximum planar induced subgraphs☆ [My Copy] Discrete Applied Mathematics, Vol. 154, No. 13. (15 August 2006), pp. 1774-1782. by L. Faria, C. Defigueiredo, S. Gravier, C. Demendonca, J. Stolfi posted to no-tag by tanderson on 2009-07-11 01:13:04 as
	Algorithms for drawing planar graphs [My Copy] (June 1993) by Goossen Kant posted to no-tag by tanderson on 2009-06-28 03:29:12 as
	A Linear Time Implementation of SPQR-Trees [My Copy] Graph Drawing (2001), pp. 77-90. by Carsten Gutwenger, Petra Mutzel posted to no-tag by tanderson on 2009-06-28 02:57:50 as
	Generating Minimal k-Vertex Connected Spanning Subgraphs [My Copy] Computing and Combinatorics (2007), pp. 222-231. by Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gabor Rudolf posted to no-tag by tanderson on 2009-06-05 21:12:31 as
	Successive edge-connectivity augmentation problems [My Copy] Mathematical Programming, Vol. 84, No. 3. (25 April 1999), pp. 577-593. by Eddie Cheng, Tibor Jordán posted to no-tag by tanderson on 2009-06-03 03:31:00 as
	On-line maintenance of the four-connected components of a graph [My Copy] Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on In Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on (1991), pp. 793-801. by A. Kanevsky, R. Tamassia, G. Di Battista, J. Chen posted to no-tag by tanderson on 2009-06-03 03:06:11 as
	A more compact visibility representation [My Copy] Graph-Theoretic Concepts in Computer Science (1994), pp. 411-424. by Goos Kant posted to no-tag by tanderson on 2009-06-03 03:04:41 as
	Augmenting the connectivity of geometric graphs [My Copy] Computational Geometry, Vol. 40, No. 3. (August 2008), pp. 220-230. by M. Abellanas, A. Garcia, F. Hurtado, J. Tejel, J. Urrutia posted to no-tag by tanderson on 2009-06-03 03:02:33 as
	Tight bounds on maximal and maximum matchings [My Copy] Discrete Mathematics, Vol. 285, No. 1-3. (August 2004), pp. 7-15. by T. Biedl posted to no-tag by tanderson on 2009-06-03 02:45:46 as
	Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching [My Copy] SIAM J. Comput, Vol. 30 (2000), pp. 292-301. by Joseph Cheriyan, Ramakrishna Thurimella posted to no-tag by tanderson on 2009-05-20 18:30:35 as
	Subgraph Induced Planar Connectivity Augmentation [My Copy] Graph-Theoretic Concepts in Computer Science (2003), pp. 261-272. by Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher posted to no-tag by tanderson on 2009-05-20 18:24:53 as
	On-line graph algorithms with SPQR-trees [My Copy] Automata, Languages and Programming (1990), pp. 598-611. by Giuseppe Di Battista, Roberto Tamassia posted to no-tag by tanderson on 2009-05-16 04:06:33 as
	Dividing a Graph into Triconnected Components [My Copy] SIAM Journal on Computing, Vol. 2, No. 3. (1973), pp. 135-158. by J. E. Hopcroft, R. E. Tarjan posted to no-tag by tanderson on 2009-05-16 03:37:34 as
	A linear time algorithm for triconnectivity augmentation [My Copy] Symposium on Foundations of Computer Science, Vol. 0 (1991), pp. 548-559. by T. S. Hsu, V. Ramachandran posted to no-tag by tanderson on 2009-05-16 02:42:50 as
	Depth-First Search and Linear Graph Algorithms [My Copy] SIAM Journal on Computing, Vol. 1, No. 2. (1972), pp. 146-160. by Robert Tarjan posted to biconnected components by tanderson on 2009-05-16 01:48:10 as along with 7 people dejan phreeza naegele djlin antonkratz timotay muraken
	On Four-Connecting a Triconnected Graph [My Copy] Journal of Algorithms, Vol. 35, No. 2. (May 2000), pp. 202-234. by T. Hsu posted to no-tag by tanderson on 2009-05-13 18:29:11 as
	On locating cubic subgraphs in bounded-degree connected bipartite graphs [My Copy] Discrete Mathematics, Vol. 163, No. 1-3. (15 January 1997), pp. 319-324. by I. Stewart posted to no-tag by tanderson on 2009-05-06 01:23:59 as
	Finding regular subgraphs in both arbitrary and planar graphs [My Copy] Discrete Applied Mathematics, Vol. 68, No. 3. (24 July 1996), pp. 223-235. by I. Stewart posted to no-tag by tanderson on 2009-05-06 01:22:30 as