Log in

Relevant bibliographies by topics / NP-complete problems / Dissertations / Theses

To see the other types of publications on this topic, follow the link: NP-complete problems.

Dissertations / Theses on the topic 'NP-complete problems'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 38 dissertations / theses for your research on the topic 'NP-complete problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Qasem, Mohamed. "Clustering solutions : a novel approach to solving NP-complete problems." Thesis, University of Southampton, 2010. https://eprints.soton.ac.uk/271282/.

Full text

Abstract:

In this thesis, we introduce a novel approach to solving MAX-SAT problems. This algorithm clusters good solutions, and restarts the search from the closest feasible configuration to the centroid of each cluster. We call this method Clustered-Landscape Guided Hopping (CLGH). In addition, where clustering does not provide an advantage due to the non-clustered landscape configuration, we use Averaged-Landscape Guided Hopping (ALGH). CLGH is shown to be highly efficient for finding good solutions of large MAX-SAT problems. Systematic studies of the landscape are presented to show that the success

APA, Harvard, Vancouver, ISO, and other styles

2

Петров, Сергій Олександрович, Сергей Александрович Петров, Serhii Oleksandrovych Petrov, Сергій Павлович Шаповалов, Сергей Павлович Шаповалов, and Serhii Pavlovych Shapovalov. "Application of the graph-theory to solve np-complete problems." Thesis, Видавництво СумДУ, 2007. http://essuir.sumdu.edu.ua/handle/123456789/14994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yu, Nuo 1983. "Fixed parameter tractable algorithms for optimal covering tours with turns." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111595.

Full text

Abstract:

Many geometry problems can be solved by transformation to graph problems. Often, both the geometry version and graph version of the problem are NP-hard - and therefore not likely to be solved in polynomial time. One approach to solving these hard problems is to use fixed parameter tractable (FPT) algorithms. We present a framework for developing FPT algorithms for graph problems using dynamic programming, monadic second order logic of graphs, tree-width, and bidimensionality. We use this framework to obtain FPT results for covering tour problems on grid-graphs with turn costs. The results for

APA, Harvard, Vancouver, ISO, and other styles

4

Maloney, John Harold. "Using constraints for user interface construction /." Thesis, Connect to this title online; UW restricted, 1991. http://hdl.handle.net/1773/6872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Connelly, Abram. "Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2533.

Full text

Abstract:

Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability. In this thesis, the Number Partition Problem and the Hamiltonian Cycle Problem are taken as representative NP-Complete classes. Numerical evidence is presented for a phase transition in the probability of solution when a modified Lévy-Stable distribution is used in instance creation for each. Numerical evidence is presented that show hard random instances exist near the critical t

APA, Harvard, Vancouver, ISO, and other styles

6

Ono, Satoshi. "In pursuit of NP-hard combinatorial optimization problems." Diss., Online access via UMI:, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Simone, James Nicholas. "NP user interface modeling." Diss., Online access via UMI:, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

McDonald, Iain. "Symmetry in constraint programming." Thesis, University of St Andrews, 2004. http://hdl.handle.net/10023/14983.

Full text

Abstract:

Constraint programming is an invaluable tool for solving many of the complex NP-complete problems that we need solutions to. These problems can be easily described as Constraint Satisfaction Problems (CSPs) and then passed to constraint solvers: complex pieces of software written to solve general CSPs efficiently. Many of the problems we need solutions to are real world problems: planning (e.g. vehicle routing), scheduling (e.g. job shop schedules) and timetabling problems (e.g. staff rotas) to name but a few. In the real world, we place structure on objects to make them easier to deal with. T

APA, Harvard, Vancouver, ISO, and other styles

9

Chung, Yau-lin, and 鍾有蓮. "Optimality and approximability of the rectangle covering problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30294873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Schmid, Markus L. "On the membership problem for pattern languages and related topics." Thesis, Loughborough University, 2012. https://dspace.lboro.ac.uk/2134/10304.

Full text

Abstract:

In this thesis, we investigate the complexity of the membership problem for pattern languages. A pattern is a string over the union of the alphabets A and X, where X := {x_1, x_2, x_3, ...} is a countable set of variables and A is a finite alphabet containing terminals (e.g., A := {a, b, c, d}). Every pattern, e.g., p := x_1 x_2 a b x_2 b x_1 c x_2, describes a pattern language, i.e., the set of all words that can be obtained by uniformly substituting the variables in the pattern by arbitrary strings over A. Hence, u := cacaaabaabcaccaa is a word of the pattern language of p, since substitutin

APA, Harvard, Vancouver, ISO, and other styles

11

Miček, David. "Genetické algoritmy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218215.

Full text

Abstract:

This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.

APA, Harvard, Vancouver, ISO, and other styles

12

Oliveira, Rommel Teodoro de. "Sobre conjuntos dominantes eficientes em grafos." Universidade Federal de Goiás, 2009. http://repositorio.bc.ufg.br/tede/handle/tde/2901.

Full text

Abstract:

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-08-12T15:13:32Z No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) dissertacao rommel cc.pdf: 1665635 bytes, checksum: 9f894f847272036c011387e2de71507f (MD5)<br>Made available in DSpace on 2014-08-12T15:13:32Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) dissertacao rommel cc.pdf: 1665635 bytes, checksum: 9f894f847272036c011387e2de71507f (MD5) Previous issue date: 2009-03-12<br>Given a graph G = (V;E) and a set of vertices D V, a

APA, Harvard, Vancouver, ISO, and other styles

13

Jurčík, Lukáš. "Evoluční algoritmy při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224447.

Full text

Abstract:

This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.

APA, Harvard, Vancouver, ISO, and other styles

14

Bristow, Andrew IV. "The INDEPENDENT SET Decision Problem is NP-complete." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2573.

Full text

Abstract:

In the 1970's computer scientists developed the theory of computational complexity. Some problems seemed hard-to-compute, while others were easy. It turned out that many of the hard problems were equally hard in a way that could be precisely specified. They became known as the NP-complete problems. The SATISFIABILITY problem (SAT) was the first problem to be proved NP-complete in 1971. Since then numerous other hard-to-solve problems have been proved to be in NP-complete. In this paper we will examine the problem of how to find a maximum independent set of vertices for a graph. This prob

APA, Harvard, Vancouver, ISO, and other styles

15

Ho, Yiu Yu. "Global secure sets of trees and grid-like graphs." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4922.

Full text

Abstract:

However, as will be demonstrated in Chapter 1, a defensive alliance may not be able to properly defend itself when multiple members are under attack at the same time. The concept of secure sets is introduced in (BDH07) for exactly this purpose. The non-empty set S is a secure set if every subset Xsubset of]S, with the assistance of vertices in S, can successfully defend against simultaneous attacks coming from vertices outside of S. The exact definition of simultaneous attacks and how such attacks may be defended will be provided in Chapter 1. In (BDH07), the authors presented an interesting c

APA, Harvard, Vancouver, ISO, and other styles

16

SACCA', FRANCESCO. "PROBLEMI DI CLUSTERING CON VINCOLI: ALGORITMI E COMPLESSITÀ." Doctoral thesis, Università degli Studi di Milano, 2010. http://hdl.handle.net/2434/150055.

Full text

Abstract:

This thesis introduces and studies the problem of 1-dimensional bounded clustering: for any fixed p ≥ 1, given reals x1, x2…, xn, and integers k1, k2.., km, determine the partition (A1, A2… Am) of {1, 2, ..., n} with |A1| = k1, |A2| = k2 , … , |Am| = km which minimizes Σk Σi Ak |xi - μk |p where μk is the p-centroid of Ak First, we prove that the optimum partition is contiguous (String Property), that is if i,j  Ak, and xi < xs < xj, then s  Ak . As a consequence, we determine an efficient algorithm for bi-clustering (if p is an integer); however, we show that the general problem

APA, Harvard, Vancouver, ISO, and other styles

17

Serédi, Silvester. "Evoluční algoritmy v úloze booleovské splnitelnosti." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236224.

Full text

Abstract:

The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.

APA, Harvard, Vancouver, ISO, and other styles

18

Rolf, Daniel. "Algorithms for the satisfiability problem." Doctoral thesis, [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=982636849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Eyono, Obono Séraphin Désiré. "Recherche efficace d'images morphiques de mots." Rouen, 1995. http://www.theses.fr/1995ROUE5014.

Full text

Abstract:

Nous étudions dans cette thèse la recherche d'un motif homomorphe dans un texte et montrons que ce problème est NP-complet. Nous établissons une première classification des motifs: les motifs simples (ou motifs élémentaires) et les motifs non simples. Nous donnons une caractérisation de la rationalité des motifs simples. Nous proposons ensuite une classification des motifs simples selon leurs degrés, ainsi qu'un algorithme efficace de recherche dans un texte des images de tout motif de degré un ou deux, qui fait gagner, ou presque gagner, un ou deux degrés de complexité par rapport à l'algorit

APA, Harvard, Vancouver, ISO, and other styles

20

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Full text

Abstract:

The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).

APA, Harvard, Vancouver, ISO, and other styles

21

Linkeová, Romana. "Problém batohu a jeho aplikace." Master's thesis, 2017. http://www.nusl.cz/ntk/nusl-367658.

Full text

Abstract:

Title: The knapsack and its applications Author: Romana Linkeová Department: Department of Algebra Supervisor: doc. Mgr. Pavel Příhoda, Ph.D., Department of Algebra Abstract: This thesis is focused on various aspects of cryptosystems based on NP (non-deterministic polynomial) complete knapsack problem. From the theory of complexity point of view, the less known parts of the proof of knapsack problem NP completeness are shown in detail. From the cryptographical point of view, a demonstration of breaking of the Merkle-Hellman cryptosystem (the basic de- sign of knapsack-type cryptosystems) is pr

APA, Harvard, Vancouver, ISO, and other styles

22

"Complexity analysis of task assignment problems and vehicle scheduling problems." Chinese University of Hong Kong, 1994. http://library.cuhk.edu.hk/record=b5887281.

Full text

Abstract:

by Chi-lok Chan.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Scheduling Problems of Chain-like Task System --- p.4<br>Chapter 2.1 --- Introduction --- p.4<br>Chapter 2.2 --- Problem Assumptions and Notations Definition --- p.7<br>Chapter 2.3 --- Related Works --- p.9<br>Chapter 2.3.1 --- Bokhari's Algorithm --- p.10<br>Chapter 2.3.2 --- Sheu and Chiang's Algorithm --- p.12<br>Chapter 2.3.3 --- Hsu's Algorithm --- p.12<br>Chapter 2.4 --- Decision Algorithms for Un-mergeable Task System --- p.18<br>Chapter 2.4.1 ---

APA, Harvard, Vancouver, ISO, and other styles

23

Lin, Hsieh Liang, and 林咸良. "Using Particle Swarm Optimization to Solve Some Discrete NP-complete Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/cth438.

Full text

Abstract:

碩士<br>聖約翰科技大學<br>資訊工程系碩士班<br>101<br>In this thesis, we proposed a hybrid approach of particle swarm optimization (PSO) for solving discrete NP-complete problems. In recent years, PSO has been a popular topic in evolutionary algorithm area. Compare to traditional algorithms, PSO has the advantages of quick converge speed and accurate search ability. However, the fast converge speed also leads to the disadvantages of being trapped in local optimum and over relying on initial swarm. On the other hand, unlike continuous problem, the solutions of discrete problem are sparsely spread among the probl

APA, Harvard, Vancouver, ISO, and other styles

24

Smith, Ronald Douglas. "A polynomial time heuristic algorithm for certain instances of 3-partition." 2014. http://liblink.bsu.edu/uhtbin/catkey/1749602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

"On exact algorithms for the maximum independent set problem." 2008. http://library.cuhk.edu.hk/record=b5896822.

Full text

Abstract:

Wong, Wing Chun.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references (leaves 66-67).<br>Abstracts in English and Chinese.<br>Abstract --- p.i<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Background Study --- p.4<br>Chapter 2.1 --- Basic Definitions and Notations --- p.5<br>Chapter 2.2 --- Tarjan and Trojanowski's algorithm --- p.6<br>Chapter 2.2.1 --- Techniques --- p.6<br>Chapter 2.2.2 --- Algorithm --- p.8<br>Chapter 2.3 --- "Fomin, Grandoni and Kratsch's Algorithm" --- p.9<br>Chapter 2.3.1 --- Tec

APA, Harvard, Vancouver, ISO, and other styles

26

Churchley, Ross William. "On graph-transverse matching problems." Thesis, 2012. http://hdl.handle.net/1828/4137.

Full text

Abstract:

Given graphs G,H, is it possible to find a matching which, when deleted from G, destroys all copies of H? The answer is obvious for some inputs—notably, when G is a large complete graph the answer is “no”—but in general this can be a very difficult question. In this thesis, we study this decision problem when H is a fixed tree or cycle; our aim is to identify those H for which it can be solved efficiently. The H-transverse matching problem, TM(H) for short, asks whether an input graph admits a matching M such that no subgraph of G − M is isomorphic to H. The main goal of this thesis is the fo

APA, Harvard, Vancouver, ISO, and other styles

27

Dimova, Boryana Slavcheva. "Characterizing neighborhoods favorable to local search techniques." Thesis, 2004. http://repositories.lib.utexas.edu/bitstream/handle/2152/1308/dimovad16980.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

"An integer programming approach for the satisfiability problems." 2001. http://library.cuhk.edu.hk/record=b5890627.

Full text

Abstract:

by Lui Oi Lun Irene.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.<br>Includes bibliographical references (leaves 128-132).<br>Abstracts in English and Chinese.<br>List of Figures --- p.vii<br>List of Tables --- p.viii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Satisfiability Problem --- p.1<br>Chapter 1.2 --- Motivation of the Research --- p.1<br>Chapter 1.3 --- Overview of the Thesis --- p.2<br>Chapter 2 --- Constraint Satisfaction Problem and Satisfiability Problem --- p.4<br>Chapter 2.1 --- Constraint Programming --- p.4<br>Chapter 2.2 --- Satisfiability

APA, Harvard, Vancouver, ISO, and other styles

29

Powell, Alan Roy. "Application of backpropagation-like generative algorithms to various problems." Thesis, 1992. http://hdl.handle.net/10413/5619.

Full text

Abstract:

Artificial neural networks (ANNs) were originally inspired by networks of biological neurons and the interactions present in networks of these neurons. The recent revival of interest in ANNs has again focused attention on the apparent ability of ANNs to solve difficult problems, such as machine vision, in novel ways. There are many types of ANNs which differ in architecture and learning algorithms, and the list grows annually. This study was restricted to feed-forward architectures and Backpropagation- like (BP-like) learning algorithms. However, it is well known that the learning problem for

APA, Harvard, Vancouver, ISO, and other styles

30

"Survivable network design of all-optical network." 2002. http://library.cuhk.edu.hk/record=b5891248.

Full text

Abstract:

Kwok-Shing Ho.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2002.<br>Includes bibliographical references (leaves 69-71).<br>Abstracts in English and Chinese.<br>List of Figures --- p.vi<br>List of Tables --- p.vii<br>Chapter Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Overview --- p.1<br>Chapter 1.2 --- Thesis Objectives --- p.6<br>Chapter 1.3 --- Outline of Thesis --- p.8<br>Chapter Chapter 2 --- The Spare Capacity Planning Problem --- p.9<br>Chapter 2.1 --- Mathematical Model of the Spare Capacity Planning Problem --- p.12<br>Chapter 2.1.1 --- Variable Definitions

APA, Harvard, Vancouver, ISO, and other styles

31

Deighton, Andrew George. "Packing problems on a PC." Thesis, 1991. http://hdl.handle.net/10413/7876.

Full text

Abstract:

Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted sub-problem of the general Container Packing problem. Since the Bin Packing problem is NP-complete, it is customary to apply a heuristic measure in order to approximate solutions in a reasonable amount of computation time rather than to attempt to produce optimal results by applying some exact algorithm. Several heuristics are examined for the pr

APA, Harvard, Vancouver, ISO, and other styles

32

De, Wet Johan Pieter. "Local properties of graphs." Thesis, 2016. http://hdl.handle.net/10500/22278.

Full text

Abstract:

We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the property P. Specically, a graph is locally traceable (LT) or locally hamiltonian (LH) if the induced graph on the neighbourhood of every vertex is traceable or hamiltonian, respectively. A locally locally hamiltonian (L2H) graph is a graph in which the graph induced by the neighbourhood of each vertex is an LH graph. This concept is generalized to an arbitrary degree of nesting, to make it possible to work with LkH graphs. This thesis focuses on the global cycle properties of LT, LH and LkH graphs.

APA, Harvard, Vancouver, ISO, and other styles

33

Iyer, Swarna Chitra. "A complementary heuristic for the unbounded knapsack problem." Thesis, 1997. https://vuir.vu.edu.au/17924/.

Full text

Abstract:

As a solution algorithm for Unbounded Knapsack Problem, the performance analysis of density-ordered greedy heuristic, weight-ordered greedy heuristic, value-ordered greedy heuristic, extended greedy heuristic and total-value heuristic has been done. Empirical experiments on different test problems have been analysed and reported. Problem instances with a very large number of undominated items were generated in addition to the types of instances suggested by Martello and Toth (1990). Theoretically, the lower bound on the performance for total-value heuristic is better than the correspon

APA, Harvard, Vancouver, ISO, and other styles

34

Sauer, Paul Van der Merwe. "The complexity of unavoidable word patterns." Thesis, 2019. http://hdl.handle.net/10500/27343.

Full text

Abstract:

Bibliography: pages 192-195<br>The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. The word α over a finite set A is said to be unavoidable for an infinite set B+ of nonempty words over a finite set B if, for all but finitely many elements w of B+, there exists a semigroup morphism φ ∶ A+ → B+ such that φ(α) is a factor of w. In this treatise, we start by presenting a historical background of results that are related to unavoidability. We present and discuss the most important theorems surrounding unavoidability in detail. We pre

APA, Harvard, Vancouver, ISO, and other styles

35

You, Ming-Sian, and 尤銘賢. "Cloud based Hybrid Evolution Algorithm for NP-Complete Pattern in Nurse Scheduling Problem." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/vv9bu5.

Full text

Abstract:

碩士<br>國立虎尾科技大學<br>資訊工程系碩士班<br>104<br>In this thesis, the Cloud based Hybrid evolution algorithm for NP-Complete Pattern in Nurse Scheduling Problem (NSP) is proposed as the Software Computing as a Service (SCaaS). Due to the low birth rate, the human resource becomes the limited resource for job assignment. To find the optimal solution for staff scheduling becomes an important issue. The proposed system follows the definition of NSP and recognizes the possible problem of NP-Complete Pattern. Only the pattern is recognized as the NSP optimal problem, the proposed system can find the optimal sol

APA, Harvard, Vancouver, ISO, and other styles

36

Eblen, John David. "The Maximum Clique Problem: Algorithms, Applications, and Implementations." 2010. http://trace.tennessee.edu/utk_graddiss/793.

Full text

Abstract:

Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then

APA, Harvard, Vancouver, ISO, and other styles

37

Rajgopal, Ninad. "Hitting and Piercing Geometric Objects Induced by a Point Set." Thesis, 2014. http://etd.iisc.ac.in/handle/2005/2882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Rajgopal, Ninad. "Hitting and Piercing Geometric Objects Induced by a Point Set." Thesis, 2014. http://hdl.handle.net/2005/2882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!