NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 98
  • 40
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 179
  • 179
  • 55
  • 45
  • 39
  • 37
  • 25
  • 23
  • 23
  • 20
  • 19
  • 16
  • 16
  • 15
  • 15
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 61 to 70 of 179 (0.068 seconds)

Spelling suggestions: "subject:"combinatorial aanalysis "" "subject:"combinatorial 2analysis ""

61

Almost self-complementary graphs and extensions.

Das, Pramod Kumar. Rosa, Alexnander. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1989. / Source: Dissertation Abstracts International, Volume: 62-13, Section: A, page: 0000.
62

Invitation to fixed-parameter algorithms /

Niedermeier, Rolf. January 2006 (has links) (PDF)
Univ., Diss.--Tübingen, 2002. / Includes bibliographical references and index.
63

Combinatorial aspects of leaf-labelled trees : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, University of Canterbury Department of Mathematics and Statistics /

Humphries, Peter J. January 2008 (has links)
Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references and index. Also available via the World Wide Web.
64

Enumerative combinatorics of posets

Carroll, Christina C. January 2008 (has links)
Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008. / Committee Chair: Tetali, Prasad; Committee Member: Duke, Richard; Committee Member: Heitsch, Christine; Committee Member: Randall, Dana; Committee Member: Trotter, William T.
65

Maximum frustration of bipartite signed graphs

Bowlin, Garry. January 2009 (has links)
Thesis (Ph. D.)--State University of New York at Binghamton, Department of Mathematical Sciences, 2009. / Includes bibliographical references.
66

A Lagrangian heuristic for winner determination problem in combinatorial auctions /

Tang, Jiqing. January 2004 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 68-74). Also available in electronic version. Access restricted to campus users.
67

Some problems related to Ramsay's theorem /

Williams, E. R. January 1967 (has links)
Thesis (M.A.)--Memorial University of Newfoundland. / Typescript. Bibliography: leaves 44-45. Also available online.
68

Low complexity normal bases /

Thomson, David January 1900 (has links)
Thesis (M.SC.) - Carleton University, 2007. / Includes bibliographical references (p. 108-109). Also available in electronic format on the Internet.
69

Towards solving the game of Go in One dimension /

Lewis, Isabel Christina. January 1900 (has links)
Thesis (M.SC.) - Carleton University, 2007. / Includes bibliographical references (p. 54-55). Also available in electronic format on the Internet.
70

On the likely number of stable marriages /

Lennon, Craig, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Includes vita and abstract. Includes bibliographical references (leaves 123-124). Also available online via OhioLINK's ETD Center http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1194991095

Page generated in 0.0903 seconds