Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Georgia Tech" +contributor:("Thomas, Robin"). Showing records 1 – 29 of 29 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Asadi Shahmirzadi, Arash. Minor-minimal non-projective planar graphs with an internal 3-separation.

Degree: PhD, Mathematics, 2012, Georgia Tech

 The property that a graph has an embedding in the projective plane is closed under taking minors. Thus by the well known Graph Minor theorem… (more)

Subjects/Keywords: C-planar; Non-projective planar; Minor-minimal; Algorithms; Graph theory; Graph theory; Geometry, Plane

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Asadi Shahmirzadi, A. (2012). Minor-minimal non-projective planar graphs with an internal 3-separation. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45914

Chicago Manual of Style (16th Edition):

Asadi Shahmirzadi, Arash. “Minor-minimal non-projective planar graphs with an internal 3-separation.” 2012. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/45914.

MLA Handbook (7th Edition):

Asadi Shahmirzadi, Arash. “Minor-minimal non-projective planar graphs with an internal 3-separation.” 2012. Web. 27 Jan 2021.

Vancouver:

Asadi Shahmirzadi A. Minor-minimal non-projective planar graphs with an internal 3-separation. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/45914.

Council of Science Editors:

Asadi Shahmirzadi A. Minor-minimal non-projective planar graphs with an internal 3-separation. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/45914


Georgia Tech

2. Backman, Spencer Christopher Foster. Combinatorial divisor theory for graphs.

Degree: PhD, Mathematics, 2014, Georgia Tech

 Chip-firing is a deceptively simple game played on the vertices of a graph, which was independently discovered in probability theory, poset theory, graph theory, and… (more)

Subjects/Keywords: Chip-firing; Graph; Tropical curve; Riemann-Roch; Orientation; Divisor theory; Combinatorial analysis; Graph theory; Geometry, Algebraic; Number theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Backman, S. C. F. (2014). Combinatorial divisor theory for graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51908

Chicago Manual of Style (16th Edition):

Backman, Spencer Christopher Foster. “Combinatorial divisor theory for graphs.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/51908.

MLA Handbook (7th Edition):

Backman, Spencer Christopher Foster. “Combinatorial divisor theory for graphs.” 2014. Web. 27 Jan 2021.

Vancouver:

Backman SCF. Combinatorial divisor theory for graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/51908.

Council of Science Editors:

Backman SCF. Combinatorial divisor theory for graphs. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51908


Georgia Tech

3. Whalen, Peter. Pfaffian orientations, flat embeddings, and Steinberg's conjecture.

Degree: PhD, Mathematics, 2014, Georgia Tech

 The first result of this thesis is a partial result in the direction of Steinberg's Conjecture. Steinberg's Conjecture states that any planar graph without cycles… (more)

Subjects/Keywords: Combinatorics; Coloring; Graph theory; Pfaffian orientations; Flat embeddings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Whalen, P. (2014). Pfaffian orientations, flat embeddings, and Steinberg's conjecture. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52207

Chicago Manual of Style (16th Edition):

Whalen, Peter. “Pfaffian orientations, flat embeddings, and Steinberg's conjecture.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/52207.

MLA Handbook (7th Edition):

Whalen, Peter. “Pfaffian orientations, flat embeddings, and Steinberg's conjecture.” 2014. Web. 27 Jan 2021.

Vancouver:

Whalen P. Pfaffian orientations, flat embeddings, and Steinberg's conjecture. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/52207.

Council of Science Editors:

Whalen P. Pfaffian orientations, flat embeddings, and Steinberg's conjecture. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52207


Georgia Tech

4. Dang, Thanh Ngoc. Minors of graphs of large path-width.

Degree: PhD, Mathematics, 2018, Georgia Tech

 Let P be a graph with a vertex v such that P-v is a forest and let Q be an outerplanar graph. In 1993 Paul… (more)

Subjects/Keywords: Graph theory; Graph; Minors; Minor; Pathwidth; Path-width; Large

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dang, T. N. (2018). Minors of graphs of large path-width. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59846

Chicago Manual of Style (16th Edition):

Dang, Thanh Ngoc. “Minors of graphs of large path-width.” 2018. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/59846.

MLA Handbook (7th Edition):

Dang, Thanh Ngoc. “Minors of graphs of large path-width.” 2018. Web. 27 Jan 2021.

Vancouver:

Dang TN. Minors of graphs of large path-width. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/59846.

Council of Science Editors:

Dang TN. Minors of graphs of large path-width. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59846


Georgia Tech

5. Xie, Shijie. 6-connected graphs are two-three linked.

Degree: PhD, Mathematics, 2019, Georgia Tech

 Let G be a graph and a0, a1, a2, b1, and b2 be distinct vertices of G. Motivated by their work on Four Color Theorem,… (more)

Subjects/Keywords: Graph theory; Disjoint paths in graphs; Two-three linked graphs; 6-connected graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xie, S. (2019). 6-connected graphs are two-three linked. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62273

Chicago Manual of Style (16th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/62273.

MLA Handbook (7th Edition):

Xie, Shijie. “6-connected graphs are two-three linked.” 2019. Web. 27 Jan 2021.

Vancouver:

Xie S. 6-connected graphs are two-three linked. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/62273.

Council of Science Editors:

Xie S. 6-connected graphs are two-three linked. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62273

6. Chenette, Nathan Lee. Symmetric schemes for efficient range and error-tolerant search on encrypted data.

Degree: PhD, Mathematics, 2012, Georgia Tech

 Large-scale data management systems rely more and more on cloud storage, where the need for efficient search capabilities clashes with the need for data confidentiality.… (more)

Subjects/Keywords: Fuzzy searchable encryption; Symmetric encryption; Searchable encryption; Hypergeometric distribution; Database security; Order-preserving encryption; Data encryption (Computer science); Cloud computing; Data protection; Database searching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chenette, N. L. (2012). Symmetric schemes for efficient range and error-tolerant search on encrypted data. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48976

Chicago Manual of Style (16th Edition):

Chenette, Nathan Lee. “Symmetric schemes for efficient range and error-tolerant search on encrypted data.” 2012. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/48976.

MLA Handbook (7th Edition):

Chenette, Nathan Lee. “Symmetric schemes for efficient range and error-tolerant search on encrypted data.” 2012. Web. 27 Jan 2021.

Vancouver:

Chenette NL. Symmetric schemes for efficient range and error-tolerant search on encrypted data. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/48976.

Council of Science Editors:

Chenette NL. Symmetric schemes for efficient range and error-tolerant search on encrypted data. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/48976

7. Ye, Tianjun. Forbidden subgraphs and 3-colorability.

Degree: PhD, Mathematics, 2012, Georgia Tech

 Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices of a graph, such that adjacent vertices use different… (more)

Subjects/Keywords: Forbidden subgraphs; 3-colorability; Graph theory; Graph coloring

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ye, T. (2012). Forbidden subgraphs and 3-colorability. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48986

Chicago Manual of Style (16th Edition):

Ye, Tianjun. “Forbidden subgraphs and 3-colorability.” 2012. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/48986.

MLA Handbook (7th Edition):

Ye, Tianjun. “Forbidden subgraphs and 3-colorability.” 2012. Web. 27 Jan 2021.

Vancouver:

Ye T. Forbidden subgraphs and 3-colorability. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/48986.

Council of Science Editors:

Ye T. Forbidden subgraphs and 3-colorability. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/48986

8. Liu, Chun-Hung. Graph structures and well-quasi-ordering.

Degree: PhD, Mathematics, 2014, Georgia Tech

 Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other words, given infinitely many graphs, one graph contains another as a… (more)

Subjects/Keywords: Graph; Topological minor; Well-quasi-ordering

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, C. (2014). Graph structures and well-quasi-ordering. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52262

Chicago Manual of Style (16th Edition):

Liu, Chun-Hung. “Graph structures and well-quasi-ordering.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/52262.

MLA Handbook (7th Edition):

Liu, Chun-Hung. “Graph structures and well-quasi-ordering.” 2014. Web. 27 Jan 2021.

Vancouver:

Liu C. Graph structures and well-quasi-ordering. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/52262.

Council of Science Editors:

Liu C. Graph structures and well-quasi-ordering. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52262

9. Goel, Gagan. Algorithms for budgeted auctions and multi-agent covering problems.

Degree: PhD, Computing, 2009, Georgia Tech

 In this thesis, we do an algorithmic study of optimization problems in budgeted auctions, and some well known covering problems in the multi-agent setting. We… (more)

Subjects/Keywords: Game theory; Covering problems; Budgeted auctions; Approximation algorithms; Algorithms; Auctions; Mathematical optimization; Algorithms

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Goel, G. (2009). Algorithms for budgeted auctions and multi-agent covering problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29679

Chicago Manual of Style (16th Edition):

Goel, Gagan. “Algorithms for budgeted auctions and multi-agent covering problems.” 2009. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/29679.

MLA Handbook (7th Edition):

Goel, Gagan. “Algorithms for budgeted auctions and multi-agent covering problems.” 2009. Web. 27 Jan 2021.

Vancouver:

Goel G. Algorithms for budgeted auctions and multi-agent covering problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/29679.

Council of Science Editors:

Goel G. Algorithms for budgeted auctions and multi-agent covering problems. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29679

10. Saket, Rishi. Intractability results for problems in computational learning and approximation.

Degree: PhD, Computing, 2009, Georgia Tech

 In this thesis we prove intractability results for well studied problems in computational learning and approximation. Let ε , mu > 0 be arbitrarily small… (more)

Subjects/Keywords: Integrality gaps; Approximation; Hardness; Learning; Combinatorial optimization; Computational learning theory; Machine learning

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Saket, R. (2009). Intractability results for problems in computational learning and approximation. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29681

Chicago Manual of Style (16th Edition):

Saket, Rishi. “Intractability results for problems in computational learning and approximation.” 2009. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/29681.

MLA Handbook (7th Edition):

Saket, Rishi. “Intractability results for problems in computational learning and approximation.” 2009. Web. 27 Jan 2021.

Vancouver:

Saket R. Intractability results for problems in computational learning and approximation. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/29681.

Council of Science Editors:

Saket R. Intractability results for problems in computational learning and approximation. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29681

11. He, Dawei. Special TK5 in graphs containing K4-.

Degree: PhD, Mathematics, 2017, Georgia Tech

 Given a graph K, TK is used to denote a subdivision of K, which is a graph obtained from K by substituting some edges for… (more)

Subjects/Keywords: Kelmans-Seymour conjecture; Subdivision of K5; K4-; Branch vertex

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

He, D. (2017). Special TK5 in graphs containing K4-. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58301

Chicago Manual of Style (16th Edition):

He, Dawei. “Special TK5 in graphs containing K4-.” 2017. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/58301.

MLA Handbook (7th Edition):

He, Dawei. “Special TK5 in graphs containing K4-.” 2017. Web. 27 Jan 2021.

Vancouver:

He D. Special TK5 in graphs containing K4-. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/58301.

Council of Science Editors:

He D. Special TK5 in graphs containing K4-. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58301

12. Mai, Tung. Distributive lattices, stable matchings, and robust solutions.

Degree: PhD, Computer Science, 2018, Georgia Tech

 The stable matching problem, first presented by mathematical economists Gale and Shapley, has been studied extensively since its introduction. As a result, a remarkably rich… (more)

Subjects/Keywords: Distributive lattice; Stable matching

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mai, T. (2018). Distributive lattices, stable matchings, and robust solutions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60238

Chicago Manual of Style (16th Edition):

Mai, Tung. “Distributive lattices, stable matchings, and robust solutions.” 2018. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/60238.

MLA Handbook (7th Edition):

Mai, Tung. “Distributive lattices, stable matchings, and robust solutions.” 2018. Web. 27 Jan 2021.

Vancouver:

Mai T. Distributive lattices, stable matchings, and robust solutions. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/60238.

Council of Science Editors:

Mai T. Distributive lattices, stable matchings, and robust solutions. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60238

13. Wang, Yan. Subdivisions of complete graphs.

Degree: PhD, Mathematics, 2017, Georgia Tech

 A subdivision of a graph G, also known as a topological G and denoted by TG, is a graph obtained from G by replacing certain… (more)

Subjects/Keywords: K5-subdivision; Independent paths; Separation; Connectivity; Discharging; Contraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, Y. (2017). Subdivisions of complete graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58633

Chicago Manual of Style (16th Edition):

Wang, Yan. “Subdivisions of complete graphs.” 2017. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/58633.

MLA Handbook (7th Edition):

Wang, Yan. “Subdivisions of complete graphs.” 2017. Web. 27 Jan 2021.

Vancouver:

Wang Y. Subdivisions of complete graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/58633.

Council of Science Editors:

Wang Y. Subdivisions of complete graphs. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58633

14. Ma, Jie. Judicious partitions of graphs and hypergraphs.

Degree: PhD, Mathematics, 2011, Georgia Tech

 Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization,… (more)

Subjects/Keywords: Judicious partition; Azuma-Hoeffding inequality; Hypergraphs; Graph theory

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ma, J. (2011). Judicious partitions of graphs and hypergraphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41064

Chicago Manual of Style (16th Edition):

Ma, Jie. “Judicious partitions of graphs and hypergraphs.” 2011. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/41064.

MLA Handbook (7th Edition):

Ma, Jie. “Judicious partitions of graphs and hypergraphs.” 2011. Web. 27 Jan 2021.

Vancouver:

Ma J. Judicious partitions of graphs and hypergraphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/41064.

Council of Science Editors:

Ma J. Judicious partitions of graphs and hypergraphs. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41064

15. Hoyer, Alexander. On the independent spanning tree conjectures and related problems.

Degree: PhD, Mathematics, 2019, Georgia Tech

 We say that trees with common root are (edge-)independent if, for any vertex in their intersection, the paths to the root induced by each tree… (more)

Subjects/Keywords: Graph theory; Structural graph theory; Independent spanning tree conjecture; Edge-independent spanning tree conjecture; Connectivity; Edge-connectivity; Independent spanning trees; Edge-independent spanning trees; Ear decomposition; Chain decomposition; Graph decomposition; Györi-Lovász theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hoyer, A. (2019). On the independent spanning tree conjectures and related problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61777

Chicago Manual of Style (16th Edition):

Hoyer, Alexander. “On the independent spanning tree conjectures and related problems.” 2019. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/61777.

MLA Handbook (7th Edition):

Hoyer, Alexander. “On the independent spanning tree conjectures and related problems.” 2019. Web. 27 Jan 2021.

Vancouver:

Hoyer A. On the independent spanning tree conjectures and related problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/61777.

Council of Science Editors:

Hoyer A. On the independent spanning tree conjectures and related problems. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61777

16. Postle, Luke Jamison. 5-list-coloring graphs on surfaces.

Degree: PhD, Mathematics, 2012, Georgia Tech

 Thomassen proved that there are only finitely many 6-critical graphs embeddable on a fixed surface. He also showed that planar graphs are 5-list-colorable. This thesis… (more)

Subjects/Keywords: Graph coloring; List-coloring; Choosability; Graph theory; Graph coloring

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Postle, L. J. (2012). 5-list-coloring graphs on surfaces. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45807

Chicago Manual of Style (16th Edition):

Postle, Luke Jamison. “5-list-coloring graphs on surfaces.” 2012. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/45807.

MLA Handbook (7th Edition):

Postle, Luke Jamison. “5-list-coloring graphs on surfaces.” 2012. Web. 27 Jan 2021.

Vancouver:

Postle LJ. 5-list-coloring graphs on surfaces. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/45807.

Council of Science Editors:

Postle LJ. 5-list-coloring graphs on surfaces. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/45807

17. Streib, Noah Sametz. Planar and hamiltonian cover graphs.

Degree: PhD, Mathematics, 2011, Georgia Tech

 This dissertation has two principal components: the dimension of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian… (more)

Subjects/Keywords: Symmetric chains; Hamiltonian cycles; Cover graphs; Height; Planarity; Dimension; Posets; Partially ordered sets; Hamiltonian graph theory

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Streib, N. S. (2011). Planar and hamiltonian cover graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/43744

Chicago Manual of Style (16th Edition):

Streib, Noah Sametz. “Planar and hamiltonian cover graphs.” 2011. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/43744.

MLA Handbook (7th Edition):

Streib, Noah Sametz. “Planar and hamiltonian cover graphs.” 2011. Web. 27 Jan 2021.

Vancouver:

Streib NS. Planar and hamiltonian cover graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/43744.

Council of Science Editors:

Streib NS. Planar and hamiltonian cover graphs. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/43744

18. Biro, Csaba. Problems and results in partially ordered sets, graphs and geometry.

Degree: PhD, Mathematics, 2008, Georgia Tech

 The thesis consist of three independent parts. In the first part, we investigate the height sequence of an element of a partially ordered set. Let… (more)

Subjects/Keywords: Geometric containment order; Correlation; Boolean lattice; Partially ordered sets; Combinatorial geometry; Lattice theory; Monotonic functions; Set theory

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Biro, C. (2008). Problems and results in partially ordered sets, graphs and geometry. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24719

Chicago Manual of Style (16th Edition):

Biro, Csaba. “Problems and results in partially ordered sets, graphs and geometry.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/24719.

MLA Handbook (7th Edition):

Biro, Csaba. “Problems and results in partially ordered sets, graphs and geometry.” 2008. Web. 27 Jan 2021.

Vancouver:

Biro C. Problems and results in partially ordered sets, graphs and geometry. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/24719.

Council of Science Editors:

Biro C. Problems and results in partially ordered sets, graphs and geometry. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24719

19. He, Qie. Topics in discrete optimization: models, complexity and algorithms.

Degree: PhD, Industrial and Systems Engineering, 2013, Georgia Tech

 In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split… (more)

Subjects/Keywords: Integer programming; Combinatorial optimization; Stochastic programming; Network flow; Production planning; Computational complexity; Mathematical optimization; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

He, Q. (2013). Topics in discrete optimization: models, complexity and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50237

Chicago Manual of Style (16th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/50237.

MLA Handbook (7th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Web. 27 Jan 2021.

Vancouver:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/50237.

Council of Science Editors:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/50237


Georgia Tech

20. Ponnuswami, Ashok Kumar. Intractability Results for some Computational Problems.

Degree: PhD, Computing, 2008, Georgia Tech

 In this thesis, we show results for some well-studied problems from learning theory and combinatorial optimization. Learning Parities under the Uniform Distribution: We study the… (more)

Subjects/Keywords: Hardness of approximation; Max-Clique; Agnostic learning; Parities; Halfspaces; Thresholds; Circuit lower bounds; Combinatorial optimization; Computational learning theory; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ponnuswami, A. K. (2008). Intractability Results for some Computational Problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24638

Chicago Manual of Style (16th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/24638.

MLA Handbook (7th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Web. 27 Jan 2021.

Vancouver:

Ponnuswami AK. Intractability Results for some Computational Problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/24638.

Council of Science Editors:

Ponnuswami AK. Intractability Results for some Computational Problems. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24638


Georgia Tech

21. Chakrabarty, Deeparnab. Algorithmic aspects of connectivity, allocation and design problems.

Degree: PhD, Computing, 2008, Georgia Tech

 Most combinatorial optimization problems are NP -hard, which imply that under well- believed complexity assumptions, there exist no polynomial time algorithms to solve them. To… (more)

Subjects/Keywords: Combinatorial optimization; Linear programming relaxations; Approximation algorithms; Combinatorial optimization; Approximation theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chakrabarty, D. (2008). Algorithmic aspects of connectivity, allocation and design problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24659

Chicago Manual of Style (16th Edition):

Chakrabarty, Deeparnab. “Algorithmic aspects of connectivity, allocation and design problems.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/24659.

MLA Handbook (7th Edition):

Chakrabarty, Deeparnab. “Algorithmic aspects of connectivity, allocation and design problems.” 2008. Web. 27 Jan 2021.

Vancouver:

Chakrabarty D. Algorithmic aspects of connectivity, allocation and design problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/24659.

Council of Science Editors:

Chakrabarty D. Algorithmic aspects of connectivity, allocation and design problems. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24659


Georgia Tech

22. Bilinski, Mark. Approximating the circumference of 3-connected claw-free graphs.

Degree: PhD, Mathematics, 2008, Georgia Tech

 Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle of length at least 1/2 n^g(d) where g(d) = (log_2… (more)

Subjects/Keywords: Claw-free; 3-connected; Long cycles; Graph theory; Decomposition (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bilinski, M. (2008). Approximating the circumference of 3-connected claw-free graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/26516

Chicago Manual of Style (16th Edition):

Bilinski, Mark. “Approximating the circumference of 3-connected claw-free graphs.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/26516.

MLA Handbook (7th Edition):

Bilinski, Mark. “Approximating the circumference of 3-connected claw-free graphs.” 2008. Web. 27 Jan 2021.

Vancouver:

Bilinski M. Approximating the circumference of 3-connected claw-free graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/26516.

Council of Science Editors:

Bilinski M. Approximating the circumference of 3-connected claw-free graphs. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/26516


Georgia Tech

23. Jiang, Wen. Maximum Codes with the Identifiable Parent Property.

Degree: PhD, Mathematics, 2006, Georgia Tech

 We study codes that have identifiable parent property. Such codes are called IPP codes. Research on IPP codes is motivated by design of schemes that… (more)

Subjects/Keywords: Graph theory; IPP codes; Graph theory; Cryptography; Ciphers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jiang, W. (2006). Maximum Codes with the Identifiable Parent Property. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/14072

Chicago Manual of Style (16th Edition):

Jiang, Wen. “Maximum Codes with the Identifiable Parent Property.” 2006. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/14072.

MLA Handbook (7th Edition):

Jiang, Wen. “Maximum Codes with the Identifiable Parent Property.” 2006. Web. 27 Jan 2021.

Vancouver:

Jiang W. Maximum Codes with the Identifiable Parent Property. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/14072.

Council of Science Editors:

Jiang W. Maximum Codes with the Identifiable Parent Property. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/14072


Georgia Tech

24. Goycoolea, Marcos G. Cutting Planes for Large Mixed Integer Programming Models.

Degree: PhD, Industrial and Systems Engineering, 2006, Georgia Tech

 In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies.… (more)

Subjects/Keywords: Traveling salesman problem; Cutting planes; Mixed integer rounding; Mixed integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Goycoolea, M. G. (2006). Cutting Planes for Large Mixed Integer Programming Models. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/13956

Chicago Manual of Style (16th Edition):

Goycoolea, Marcos G. “Cutting Planes for Large Mixed Integer Programming Models.” 2006. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/13956.

MLA Handbook (7th Edition):

Goycoolea, Marcos G. “Cutting Planes for Large Mixed Integer Programming Models.” 2006. Web. 27 Jan 2021.

Vancouver:

Goycoolea MG. Cutting Planes for Large Mixed Integer Programming Models. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/13956.

Council of Science Editors:

Goycoolea MG. Cutting Planes for Large Mixed Integer Programming Models. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/13956


Georgia Tech

25. Das Sarma, Atish. Algorithms for large graphs.

Degree: PhD, Computing, 2010, Georgia Tech

Subjects/Keywords: Random walks; Distances; Distributed computing; Graphs; PageRank; Distributed algorithms; Online algorithms; Streaming algorithms; Algorithms; Electronic data processing Distributed processing; Parallel algorithms; Graph algorithms; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Das Sarma, A. (2010). Algorithms for large graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34709

Chicago Manual of Style (16th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/34709.

MLA Handbook (7th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Web. 27 Jan 2021.

Vancouver:

Das Sarma A. Algorithms for large graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/34709.

Council of Science Editors:

Das Sarma A. Algorithms for large graphs. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34709


Georgia Tech

26. Inkmann, Torsten. Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem.

Degree: PhD, Mathematics, 2007, Georgia Tech

 The tree-width and branch-width of a graph are two well-studied examples of parameters that measure how well a given graph can be decomposed into a… (more)

Subjects/Keywords: Tree-decompositions; TSP; Branch-width; Graphs on surfaces; Graph theory; Branch-decompositions; Decomposition method; Graph theory; Traveling-salesman problem; Programming (Mathematics); Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Inkmann, T. (2007). Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/22583

Chicago Manual of Style (16th Edition):

Inkmann, Torsten. “Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem.” 2007. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/22583.

MLA Handbook (7th Edition):

Inkmann, Torsten. “Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem.” 2007. Web. 27 Jan 2021.

Vancouver:

Inkmann T. Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/22583.

Council of Science Editors:

Inkmann T. Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. [Doctoral Dissertation]. Georgia Tech; 2007. Available from: http://hdl.handle.net/1853/22583


Georgia Tech

27. Karande, Chinmay. Algorithms and mechanism design for multi-agent systems.

Degree: PhD, Computing, 2010, Georgia Tech

 A scenario where multiple entities interact with a common environment to achieve individual and common goals either co-operatively or competitively can be classified as a… (more)

Subjects/Keywords: Multi-agent systems; Online auction; Algorithms; Mechanism design; Submodular functions; Matroids

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karande, C. (2010). Algorithms and mechanism design for multi-agent systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/37229

Chicago Manual of Style (16th Edition):

Karande, Chinmay. “Algorithms and mechanism design for multi-agent systems.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/37229.

MLA Handbook (7th Edition):

Karande, Chinmay. “Algorithms and mechanism design for multi-agent systems.” 2010. Web. 27 Jan 2021.

Vancouver:

Karande C. Algorithms and mechanism design for multi-agent systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/37229.

Council of Science Editors:

Karande C. Algorithms and mechanism design for multi-agent systems. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/37229


Georgia Tech

28. Devanur, Nikhil Rangarajan. Efficient Algorithms for Market Equilibria.

Degree: PhD, Computing, 2007, Georgia Tech

 The mathematical modelling of a market, and the proof of existence of equilibria have been of central importance in mathematical economics. Since the existence proof… (more)

Subjects/Keywords: Combinatorial; Network flow; Utilities; Arrow-Debreu; Fisher

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Devanur, N. R. (2007). Efficient Algorithms for Market Equilibria. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/16282

Chicago Manual of Style (16th Edition):

Devanur, Nikhil Rangarajan. “Efficient Algorithms for Market Equilibria.” 2007. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/16282.

MLA Handbook (7th Edition):

Devanur, Nikhil Rangarajan. “Efficient Algorithms for Market Equilibria.” 2007. Web. 27 Jan 2021.

Vancouver:

Devanur NR. Efficient Algorithms for Market Equilibria. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/16282.

Council of Science Editors:

Devanur NR. Efficient Algorithms for Market Equilibria. [Doctoral Dissertation]. Georgia Tech; 2007. Available from: http://hdl.handle.net/1853/16282


Georgia Tech

29. Norine, Serguei. Matching structure and Pfaffian orientations of graphs.

Degree: PhD, Mathematics, 2005, Georgia Tech

 The first result of this thesis is a generation theorem for bricks. A brick is a 3-connected graph such that the graph obtained from it… (more)

Subjects/Keywords: Pfaffian orientations; Graph theory; Matching theory; Pfaffian systems; Matching theory; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Norine, S. (2005). Matching structure and Pfaffian orientations of graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/7232

Chicago Manual of Style (16th Edition):

Norine, Serguei. “Matching structure and Pfaffian orientations of graphs.” 2005. Doctoral Dissertation, Georgia Tech. Accessed January 27, 2021. http://hdl.handle.net/1853/7232.

MLA Handbook (7th Edition):

Norine, Serguei. “Matching structure and Pfaffian orientations of graphs.” 2005. Web. 27 Jan 2021.

Vancouver:

Norine S. Matching structure and Pfaffian orientations of graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2021 Jan 27]. Available from: http://hdl.handle.net/1853/7232.

Council of Science Editors:

Norine S. Matching structure and Pfaffian orientations of graphs. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/7232

.