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 subject:(parameterized complexity). Showing records 1 – 30 of 34 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Waterloo

1. Islam, Tarique. Characterizing Hardness in Parameterized Complexity.

Degree: 2007, University of Waterloo

Parameterized complexity theory relaxes the classical notion of tractability and allows to solve some classically hard problems in a reasonably efficient way. However, many problems… (more)

Subjects/Keywords: parameterized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Islam, T. (2007). Characterizing Hardness in Parameterized Complexity. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Islam, Tarique. “Characterizing Hardness in Parameterized Complexity.” 2007. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/3041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Islam, Tarique. “Characterizing Hardness in Parameterized Complexity.” 2007. Web. 07 Dec 2019.

Vancouver:

Islam T. Characterizing Hardness in Parameterized Complexity. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/3041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Islam T. Characterizing Hardness in Parameterized Complexity. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Edinburgh

2. Chakraborty, Chiranjit. Instance compression of parametric problems and related hierarchies.

Degree: PhD, 2014, University of Edinburgh

 We define instance compressibility ([13, 17]) for parametric problems in the classes PH and PSPACE.We observe that the problem ƩiCIRCUITSAT of deciding satisfiability of a… (more)

Subjects/Keywords: 519.5; parameterized complexity; counting problems; instance compression; complexity hierarchies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chakraborty, C. (2014). Instance compression of parametric problems and related hierarchies. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8920

Chicago Manual of Style (16th Edition):

Chakraborty, Chiranjit. “Instance compression of parametric problems and related hierarchies.” 2014. Doctoral Dissertation, University of Edinburgh. Accessed December 07, 2019. http://hdl.handle.net/1842/8920.

MLA Handbook (7th Edition):

Chakraborty, Chiranjit. “Instance compression of parametric problems and related hierarchies.” 2014. Web. 07 Dec 2019.

Vancouver:

Chakraborty C. Instance compression of parametric problems and related hierarchies. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1842/8920.

Council of Science Editors:

Chakraborty C. Instance compression of parametric problems and related hierarchies. [Doctoral Dissertation]. University of Edinburgh; 2014. Available from: http://hdl.handle.net/1842/8920


Boston University

3. Finkelstein, Jeffrey. Parallelism with limited nondeterminism.

Degree: PhD, Computer Science, 2017, Boston University

 Computational complexity theory studies which computational problems can be solved with limited access to resources. The past fifty years have seen a focus on the… (more)

Subjects/Keywords: Computer science; Computational complexity; Limited nondeterminism; Nondeterminism; Parallelism; Parameterized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Finkelstein, J. (2017). Parallelism with limited nondeterminism. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/20720

Chicago Manual of Style (16th Edition):

Finkelstein, Jeffrey. “Parallelism with limited nondeterminism.” 2017. Doctoral Dissertation, Boston University. Accessed December 07, 2019. http://hdl.handle.net/2144/20720.

MLA Handbook (7th Edition):

Finkelstein, Jeffrey. “Parallelism with limited nondeterminism.” 2017. Web. 07 Dec 2019.

Vancouver:

Finkelstein J. Parallelism with limited nondeterminism. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2144/20720.

Council of Science Editors:

Finkelstein J. Parallelism with limited nondeterminism. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/20720

4. Meng, Jie. Kernelization and Enumeration: New Approaches to Solving Hard Problems.

Degree: 2011, Texas A&M University

 NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However… (more)

Subjects/Keywords: Kernelization; Enumeration; Parameterized complexity

…theory of parameterized computation and complexity is recently developed to deal with the NP… …book [35] for more details of parameterized computation and complexity. In this… …section, we will introduce the parameterized complexity and computation. The following is the… …parameterized definition. Similar to P versus NP in the classical complexity theory, we show that with… …parameterized complexity. Before we present the definition, we introduce a group of satisfiability… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meng, J. (2011). Kernelization and Enumeration: New Approaches to Solving Hard Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Meng, Jie. “Kernelization and Enumeration: New Approaches to Solving Hard Problems.” 2011. Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Meng, Jie. “Kernelization and Enumeration: New Approaches to Solving Hard Problems.” 2011. Web. 07 Dec 2019.

Vancouver:

Meng J. Kernelization and Enumeration: New Approaches to Solving Hard Problems. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Meng J. Kernelization and Enumeration: New Approaches to Solving Hard Problems. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

5. Zhang, Fenghui. Effective algorithms and protocols for wireless networking: a topological approach.

Degree: 2008, Texas A&M University

 Much research has been done on wireless sensor networks. However, most protocols and algorithms for such networks are based on the ideal model Unit Disk… (more)

Subjects/Keywords: optimization; parameterized computation; wireless sensor networks; complexity; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, F. (2008). Effective algorithms and protocols for wireless networking: a topological approach. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/86012

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhang, Fenghui. “Effective algorithms and protocols for wireless networking: a topological approach.” 2008. Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/86012.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhang, Fenghui. “Effective algorithms and protocols for wireless networking: a topological approach.” 2008. Web. 07 Dec 2019.

Vancouver:

Zhang F. Effective algorithms and protocols for wireless networking: a topological approach. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/86012.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang F. Effective algorithms and protocols for wireless networking: a topological approach. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/86012

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Maniatis, Spyridon. Cyclability: combinatorial properties, algorithms and complexity.

Degree: 2018, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

A graph G is called k-cyclable, if for every k of its vertices there exists a cycle in G that contains them. The cyclability of… (more)

Subjects/Keywords: Κυκλωσιμότητα; Παραμετρική πολυπλοκότητα; Πυρήνας; Δεσμώσεις; Cyclability; Parameterized complexity; Kernel; Linkages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maniatis, S. (2018). Cyclability: combinatorial properties, algorithms and complexity. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/43502

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maniatis, Spyridon. “Cyclability: combinatorial properties, algorithms and complexity.” 2018. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed December 07, 2019. http://hdl.handle.net/10442/hedi/43502.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maniatis, Spyridon. “Cyclability: combinatorial properties, algorithms and complexity.” 2018. Web. 07 Dec 2019.

Vancouver:

Maniatis S. Cyclability: combinatorial properties, algorithms and complexity. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10442/hedi/43502.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maniatis S. Cyclability: combinatorial properties, algorithms and complexity. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. Available from: http://hdl.handle.net/10442/hedi/43502

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Simjour, Narges. Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations.

Degree: 2013, University of Waterloo

 In this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as… (more)

Subjects/Keywords: Parameterized complexity; Enumeration

…2.1.5 Parameterized Problems In response to the inherent complexity of NP-hard problems… …captures the complexity of the problem. 11 Definition 2.21. A parameterized search problem is… …x29;, g(k)) ∈ L2 . The main hierarchy of parameterized complexity classes is… …x5B;1]. The complexity class M[1] is the class of all parameterized problems… …Concluding Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 6 Parameterized… 

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):

Simjour, N. (2013). Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7774

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Simjour, Narges. “Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations.” 2013. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/7774.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Simjour, Narges. “Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations.” 2013. Web. 07 Dec 2019.

Vancouver:

Simjour N. Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/7774.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Simjour N. Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7774

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Bonnet, Edouard. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.

Degree: Docteur es, Informatique, 2014, Paris 9

De nombreux problèmes de la vie réelle sont NP-Difficiles et ne peuvent pas être résolus en temps polynomial. Deux paradigmes notables pour les résoudre quand… (more)

Subjects/Keywords: Problèmes difficiles; Complexité paramétrée; Approximation; Sparsification; Hard problems; Parameterized complexity; Approximation; Sparsification; 511.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bonnet, E. (2014). Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2014PA090040

Chicago Manual of Style (16th Edition):

Bonnet, Edouard. “Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.” 2014. Doctoral Dissertation, Paris 9. Accessed December 07, 2019. http://www.theses.fr/2014PA090040.

MLA Handbook (7th Edition):

Bonnet, Edouard. “Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.” 2014. Web. 07 Dec 2019.

Vancouver:

Bonnet E. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. [Internet] [Doctoral dissertation]. Paris 9; 2014. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2014PA090040.

Council of Science Editors:

Bonnet E. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. [Doctoral Dissertation]. Paris 9; 2014. Available from: http://www.theses.fr/2014PA090040


Virginia Tech

9. Cadena, Jose Eduardo. Finding Interesting Subgraphs with Guarantees.

Degree: PhD, Computer Science, 2018, Virginia Tech

 Networks are a mathematical abstraction of the interactions between a set of entities, with extensive applications in social science, epidemiology, bioinformatics, and cybersecurity, among others.… (more)

Subjects/Keywords: Graph Mining; Data Mining; Graph Algorithms; Anomaly Detection; Finding Subgraphs; Parameterized Complexity; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cadena, J. E. (2018). Finding Interesting Subgraphs with Guarantees. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/81960

Chicago Manual of Style (16th Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Doctoral Dissertation, Virginia Tech. Accessed December 07, 2019. http://hdl.handle.net/10919/81960.

MLA Handbook (7th Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Web. 07 Dec 2019.

Vancouver:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10919/81960.

Council of Science Editors:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/81960

10. Chapelle, Mathieu. Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions.

Degree: Docteur es, Informatique, 2011, Université d'Orléans

Les décompositions de graphes, lorsqu’elles sont de petite largeur, sont souvent utilisées pour résoudre plus efficacement des problèmes étant difficiles dans le cas de graphes… (more)

Subjects/Keywords: Décomposition de graphes; Coimplexité paramétrée; K-COLORATION ADDITIVE; Graph decomposition; Parameterized complexity; K- ADDITIVE COLORING

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chapelle, M. (2011). Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2011ORLE2057

Chicago Manual of Style (16th Edition):

Chapelle, Mathieu. “Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions.” 2011. Doctoral Dissertation, Université d'Orléans. Accessed December 07, 2019. http://www.theses.fr/2011ORLE2057.

MLA Handbook (7th Edition):

Chapelle, Mathieu. “Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions.” 2011. Web. 07 Dec 2019.

Vancouver:

Chapelle M. Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions. [Internet] [Doctoral dissertation]. Université d'Orléans; 2011. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2011ORLE2057.

Council of Science Editors:

Chapelle M. Décompositions de graphes : quelques limites et obstructions : Graphs decompositions : some limits and obstructions. [Doctoral Dissertation]. Université d'Orléans; 2011. Available from: http://www.theses.fr/2011ORLE2057


Université Montpellier II

11. Watrigant, Rémi. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.

Degree: Docteur es, Informatique, 2014, Université Montpellier II

La théorie de la NP-complétude nous apprend que pour un certain nombre de problèmes d'optimisation, il est vain d'espérer un algorithme efficace calculant une solution… (more)

Subjects/Keywords: Optimisation combinatoire; Approximation; Complexité paramétrée; Problèmes de graphes; Combinatorial optimization; Approximation; Parameterized complexity; Graph problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watrigant, R. (2014). Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2014MON20100

Chicago Manual of Style (16th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Doctoral Dissertation, Université Montpellier II. Accessed December 07, 2019. http://www.theses.fr/2014MON20100.

MLA Handbook (7th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Web. 07 Dec 2019.

Vancouver:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Internet] [Doctoral dissertation]. Université Montpellier II; 2014. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2014MON20100.

Council of Science Editors:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Doctoral Dissertation]. Université Montpellier II; 2014. Available from: http://www.theses.fr/2014MON20100

12. Duvillié, Guillerme. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.

Degree: Docteur es, Informatique, 2016, Montpellier

 Au cours de la thèse, nous nous sommes intéressés aux problèmes d'empilement de wafers. Ces problèmes apparaissent lors de la fabrication de processeurs en 3… (more)

Subjects/Keywords: Optimisation; Test; Combinatoire; Approximation; Complexité paramétrée; Optimization; Test; Combinatorial; Approximability; Parameterized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duvillié, G. (2016). Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2016MONTT321

Chicago Manual of Style (16th Edition):

Duvillié, Guillerme. “Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.” 2016. Doctoral Dissertation, Montpellier. Accessed December 07, 2019. http://www.theses.fr/2016MONTT321.

MLA Handbook (7th Edition):

Duvillié, Guillerme. “Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.” 2016. Web. 07 Dec 2019.

Vancouver:

Duvillié G. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. [Internet] [Doctoral dissertation]. Montpellier; 2016. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2016MONTT321.

Council of Science Editors:

Duvillié G. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. [Doctoral Dissertation]. Montpellier; 2016. Available from: http://www.theses.fr/2016MONTT321


University of Victoria

13. Scott, Allan Edward Jolicoeur. On the parameterized complexity of finding short winning strategies in combinatorial games.

Degree: Dept. of Computer Science, 2010, University of Victoria

 A combinatorial game is a game in which all players have perfect information and there is no element of chance; some well-known examples include othello,… (more)

Subjects/Keywords: computational complexity; combinatorial game theory; parameterized complexity; algorithmic combinatorial game theory; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scott, A. E. J. (2010). On the parameterized complexity of finding short winning strategies in combinatorial games. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Scott, Allan Edward Jolicoeur. “On the parameterized complexity of finding short winning strategies in combinatorial games.” 2010. Thesis, University of Victoria. Accessed December 07, 2019. http://hdl.handle.net/1828/2676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Scott, Allan Edward Jolicoeur. “On the parameterized complexity of finding short winning strategies in combinatorial games.” 2010. Web. 07 Dec 2019.

Vancouver:

Scott AEJ. On the parameterized complexity of finding short winning strategies in combinatorial games. [Internet] [Thesis]. University of Victoria; 2010. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1828/2676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Scott AEJ. On the parameterized complexity of finding short winning strategies in combinatorial games. [Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

14. Dey, Palash. Resolving the Complexity of Some Fundamental Problems in Computational Social Choice.

Degree: 2016, Indian Institute of Science

 In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they… (more)

Subjects/Keywords: Computational Social Choice; Election Control; Election Winner Determination; Voter Preference Elicitation; Voting; Possible Winner; Voting Theory; Kernelization Complexity; Coalitional Manipulation; Parameterized Complexity; Computational Complexity; Frugal Bribery in Voting; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dey, P. (2016). Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2923

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dey, Palash. “Resolving the Complexity of Some Fundamental Problems in Computational Social Choice.” 2016. Thesis, Indian Institute of Science. Accessed December 07, 2019. http://hdl.handle.net/2005/2923.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dey, Palash. “Resolving the Complexity of Some Fundamental Problems in Computational Social Choice.” 2016. Web. 07 Dec 2019.

Vancouver:

Dey P. Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2005/2923.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dey P. Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2923

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Fournier, Paulin. Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques.

Degree: Docteur es, Informatique, 2015, Rennes 1

Ce travail s'inscrit dans le cadre de la vérification formelle de programmes. La vérification de modèle permet de s'assurer qu'une propriété est vérifiée par le… (more)

Subjects/Keywords: Vérification paramétrée; Vérification de modèles; Complexité; Probabilité; Protocoles de diffusion; Model checking; Parameterized verification; Complexity; Probability; Broadcast protocols

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fournier, P. (2015). Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2015REN1S170

Chicago Manual of Style (16th Edition):

Fournier, Paulin. “Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques.” 2015. Doctoral Dissertation, Rennes 1. Accessed December 07, 2019. http://www.theses.fr/2015REN1S170.

MLA Handbook (7th Edition):

Fournier, Paulin. “Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques.” 2015. Web. 07 Dec 2019.

Vancouver:

Fournier P. Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques. [Internet] [Doctoral dissertation]. Rennes 1; 2015. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2015REN1S170.

Council of Science Editors:

Fournier P. Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques : Vérification paramétrée de réseaux composés d'une multitude de processus identiques. [Doctoral Dissertation]. Rennes 1; 2015. Available from: http://www.theses.fr/2015REN1S170


Texas A&M University

16. Xia, Ge. Parameterized algorithms and computational lower bounds: a structural approach.

Degree: 2006, Texas A&M University

 Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to… (more)

Subjects/Keywords: Algorithms; Computational Complexity; Computational Lower Bounds; Parameterized Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, G. (2006). Parameterized algorithms and computational lower bounds: a structural approach. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/4322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xia, Ge. “Parameterized algorithms and computational lower bounds: a structural approach.” 2006. Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/4322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xia, Ge. “Parameterized algorithms and computational lower bounds: a structural approach.” 2006. Web. 07 Dec 2019.

Vancouver:

Xia G. Parameterized algorithms and computational lower bounds: a structural approach. [Internet] [Thesis]. Texas A&M University; 2006. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/4322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xia G. Parameterized algorithms and computational lower bounds: a structural approach. [Thesis]. Texas A&M University; 2006. Available from: http://hdl.handle.net/1969.1/4322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Sikora, Florian. Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison.

Degree: Docteur es, Informatique, 2011, Université Paris-Est

Pour mieux saisir les liens complexes entre génotype et phénotype, une méthode utilisée consiste à étudier les relations entre différents éléments biologiques (entre les protéines,… (more)

Subjects/Keywords: Bio-informatique; Algorithmique; Complexité paramétrée; Approximation; Réseaux biologiques; Génomique comparative; Bio-informatic; Algorithmics; Parameterized complexity; Approximation; Biological networks; Comparative genomics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sikora, F. (2011). Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2011PEST1048

Chicago Manual of Style (16th Edition):

Sikora, Florian. “Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison.” 2011. Doctoral Dissertation, Université Paris-Est. Accessed December 07, 2019. http://www.theses.fr/2011PEST1048.

MLA Handbook (7th Edition):

Sikora, Florian. “Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison.” 2011. Web. 07 Dec 2019.

Vancouver:

Sikora F. Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison. [Internet] [Doctoral dissertation]. Université Paris-Est; 2011. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2011PEST1048.

Council of Science Editors:

Sikora F. Aspects algorithmiques de la comparaison d'éléments biologiques : Algorithmics aspects of biological entities comparison. [Doctoral Dissertation]. Université Paris-Est; 2011. Available from: http://www.theses.fr/2011PEST1048

18. Watel, Dimitri. Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem.

Degree: Docteur es, Informatique, 2014, Versailles-St Quentin en Yvelines

Dans un graphe orienté contenant un nœud appelé racine, un sous ensemble de nœuds appelés terminaux et une pondération sur les arcs, le problème de… (more)

Subjects/Keywords: Optimisation combinatoire; Approximation polynomiale; Complexité paramétrée; Arborescence de Steiner; Combinatorial optimization; Polynomial approximation; Parameterized complexity; Directed Steiner tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watel, D. (2014). Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem. (Doctoral Dissertation). Versailles-St Quentin en Yvelines. Retrieved from http://www.theses.fr/2014VERS0025

Chicago Manual of Style (16th Edition):

Watel, Dimitri. “Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem.” 2014. Doctoral Dissertation, Versailles-St Quentin en Yvelines. Accessed December 07, 2019. http://www.theses.fr/2014VERS0025.

MLA Handbook (7th Edition):

Watel, Dimitri. “Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem.” 2014. Web. 07 Dec 2019.

Vancouver:

Watel D. Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem. [Internet] [Doctoral dissertation]. Versailles-St Quentin en Yvelines; 2014. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2014VERS0025.

Council of Science Editors:

Watel D. Approximation de l'arborescence de Steiner : Approximation of the Directed Steiner Tree Problem. [Doctoral Dissertation]. Versailles-St Quentin en Yvelines; 2014. Available from: http://www.theses.fr/2014VERS0025


University of Waterloo

19. Loker, David Ryan. Representations and Parameterizations of Combinatorial Auctions.

Degree: 2007, University of Waterloo

 Combinatorial auctions (CAs) are an important mechanism for allocating multiple items while allowing agents to specify preferences over bundles of items. In order to communicate… (more)

Subjects/Keywords: combinatorial auctions; parameterized complexity; bid graphs; item graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loker, D. R. (2007). Representations and Parameterizations of Combinatorial Auctions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Loker, David Ryan. “Representations and Parameterizations of Combinatorial Auctions.” 2007. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/3448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Loker, David Ryan. “Representations and Parameterizations of Combinatorial Auctions.” 2007. Web. 07 Dec 2019.

Vancouver:

Loker DR. Representations and Parameterizations of Combinatorial Auctions. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/3448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Loker DR. Representations and Parameterizations of Combinatorial Auctions. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Chopin, Morgan. Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation.

Degree: Docteur es, Informatique, 2013, Paris 9

Dans cette thèse, nous étudions la complexité algorithmique de problèmes d'optimisation impliquant un processus de diffusion dans un graphe. Plus précisément, nous nous intéressons tout… (more)

Subjects/Keywords: Optimisation combinatoire; Théorie des graphes; Algorithmes d'approximation; Complexité paramétrée; Approximation paramétrée; Réseaux sociaux; Problème du pompier; Selection d'un ensemble cible; Combinatorial optimization; Graph theory; Approximation algorithms; Parameterized complexity; Parameterized approximation; Social networks; Firefighter problem; Target set selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chopin, M. (2013). Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2013PA090023

Chicago Manual of Style (16th Edition):

Chopin, Morgan. “Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation.” 2013. Doctoral Dissertation, Paris 9. Accessed December 07, 2019. http://www.theses.fr/2013PA090023.

MLA Handbook (7th Edition):

Chopin, Morgan. “Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation.” 2013. Web. 07 Dec 2019.

Vancouver:

Chopin M. Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation. [Internet] [Doctoral dissertation]. Paris 9; 2013. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2013PA090023.

Council of Science Editors:

Chopin M. Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation : Optimization problems with propagation in graphs : Parameterized complexity and approximation. [Doctoral Dissertation]. Paris 9; 2013. Available from: http://www.theses.fr/2013PA090023

21. Dinh, Hiep. Exploring Algorithms for Branch Decompositions of Planar Graphs.

Degree: MS, Computer Science (Engineering and Technology), 2008, Ohio University

  A branch decomposition is a type of graph decomposition closely related to the widely studied tree decompositions introduced by Robertson and Seymour. Unlike tree… (more)

Subjects/Keywords: Computer Science; branch decompositions; parameterized complexity; graph decompositions

…on parameterized complexity. Let us make an assumption that the parameterized version does… …1 Introduction Computational complexity identifies problems as efficiently solvable if… …algorithms for them, we look into the parameterized versions of NP-Hard problems. In parameterized… …complexity, problems have an additional parameter to the input; this makes the running time a… …parameterized problem is Fixed-Parameter Tractable (FPT) if it has an algorithm with the… 

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):

Dinh, H. (2008). Exploring Algorithms for Branch Decompositions of Planar Graphs. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625

Chicago Manual of Style (16th Edition):

Dinh, Hiep. “Exploring Algorithms for Branch Decompositions of Planar Graphs.” 2008. Masters Thesis, Ohio University. Accessed December 07, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625.

MLA Handbook (7th Edition):

Dinh, Hiep. “Exploring Algorithms for Branch Decompositions of Planar Graphs.” 2008. Web. 07 Dec 2019.

Vancouver:

Dinh H. Exploring Algorithms for Branch Decompositions of Planar Graphs. [Internet] [Masters thesis]. Ohio University; 2008. [cited 2019 Dec 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625.

Council of Science Editors:

Dinh H. Exploring Algorithms for Branch Decompositions of Planar Graphs. [Masters Thesis]. Ohio University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1222984625


Université Montpellier II

22. Perez, Anthony. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.

Degree: Docteur es, Informatique, 2011, Université Montpellier II

Dans le cadre de cette thèse, nous considérons la complexité paramétrée de problèmes NP-complets. Plus précisément, nous nous intéressons à l'existence d'algorithmes de noyau polynomiaux… (more)

Subjects/Keywords: Complexité paramétrée; Noyaux; Édition de graphes; Édition de contraintes; Branches; Conflict packing; Parameterized complexity; Kernelization; Graph modification problem; Constraint modification problem; Branches; Conflict packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perez, A. (2011). Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2011MON20240

Chicago Manual of Style (16th Edition):

Perez, Anthony. “Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.” 2011. Doctoral Dissertation, Université Montpellier II. Accessed December 07, 2019. http://www.theses.fr/2011MON20240.

MLA Handbook (7th Edition):

Perez, Anthony. “Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems.” 2011. Web. 07 Dec 2019.

Vancouver:

Perez A. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. [Internet] [Doctoral dissertation]. Université Montpellier II; 2011. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2011MON20240.

Council of Science Editors:

Perez A. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures : Kernelization algorithms for graph and other structures modification problems. [Doctoral Dissertation]. Université Montpellier II; 2011. Available from: http://www.theses.fr/2011MON20240


Indian Institute of Science

23. Goyal, Prachi. Parameterized Complexity of Maximum Edge Coloring in Graphs.

Degree: 2012, Indian Institute of Science

 The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent… (more)

Subjects/Keywords: Graph Theory; Graphs; Graphs - Coloring; Parameterized Complexity; Maximum Edge Coloring (Graphs); Fixed Parameter Tractable Algorithms; Kernelization; Graph Edge Coloring; FPT Algorithm; Polynomial Kernel; C4-free Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goyal, P. (2012). Parameterized Complexity of Maximum Edge Coloring in Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3255

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2012. Thesis, Indian Institute of Science. Accessed December 07, 2019. http://hdl.handle.net/2005/3255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Goyal, Prachi. “Parameterized Complexity of Maximum Edge Coloring in Graphs.” 2012. Web. 07 Dec 2019.

Vancouver:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2005/3255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Goyal P. Parameterized Complexity of Maximum Edge Coloring in Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/3255

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Weijer, P. de. Kernelization Upper Bounds for Parameterized Graph Coloring Problems.

Degree: 2013, Universiteit Utrecht

 This thesis studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances, fol- lowing up on a… (more)

Subjects/Keywords: Kernelization; Graph Coloring; Parameterization; Parameterized Complexity; Preprocessing; Chromatic Number

…bound for Chromatic Number parameterized by the edge deletion distance to a forest (… …Forest+ke). Section 4.2 then provides an upper bound for Chromatic Number parameterized by… …Chromatic Number parameterized by the edge modification distance to a cocluster graph (… …for Chromatic Number parameterized by the edge deletion distance to a cograph (Cograph… …provided. We define Chromatic Number parameterized by the edge deletion distance to a forest as… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weijer, P. d. (2013). Kernelization Upper Bounds for Parameterized Graph Coloring Problems. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/282674

Chicago Manual of Style (16th Edition):

Weijer, P de. “Kernelization Upper Bounds for Parameterized Graph Coloring Problems.” 2013. Masters Thesis, Universiteit Utrecht. Accessed December 07, 2019. http://dspace.library.uu.nl:8080/handle/1874/282674.

MLA Handbook (7th Edition):

Weijer, P de. “Kernelization Upper Bounds for Parameterized Graph Coloring Problems.” 2013. Web. 07 Dec 2019.

Vancouver:

Weijer Pd. Kernelization Upper Bounds for Parameterized Graph Coloring Problems. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Dec 07]. Available from: http://dspace.library.uu.nl:8080/handle/1874/282674.

Council of Science Editors:

Weijer Pd. Kernelization Upper Bounds for Parameterized Graph Coloring Problems. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/282674


INP Toulouse

25. Carbonnel, Clément. Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables.

Degree: Docteur es, Intelligence Artificielle, 2016, INP Toulouse

Le problème de satisfaction de contraintes (CSP) est un problème NP-complet classique en intelligence artificielle qui a suscité un engouement important de la communauté scientifique… (more)

Subjects/Keywords: Problème de satisfaction de Contraintes; Classe traitable; Polymorphisme; Backdoor; Complexité paramétrée; Kernelisation; Constraint satisfaction Problem; Tractable class; Polymorphism; Backdoor; Parameterized complexity; Kernelization; 006

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carbonnel, C. (2016). Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2016INPT0118

Chicago Manual of Style (16th Edition):

Carbonnel, Clément. “Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables.” 2016. Doctoral Dissertation, INP Toulouse. Accessed December 07, 2019. http://www.theses.fr/2016INPT0118.

MLA Handbook (7th Edition):

Carbonnel, Clément. “Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables.” 2016. Web. 07 Dec 2019.

Vancouver:

Carbonnel C. Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables. [Internet] [Doctoral dissertation]. INP Toulouse; 2016. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2016INPT0118.

Council of Science Editors:

Carbonnel C. Harnessing tractability in constraint satisfaction problems : Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables. [Doctoral Dissertation]. INP Toulouse; 2016. Available from: http://www.theses.fr/2016INPT0118


Université Montpellier II

26. Daligault, Jean. Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.

Degree: Docteur es, Informatique, 2011, Université Montpellier II

Dans cette thèse, nous abordons des problèmes NP-difficiles à l'aide de techniques combinatoires, en se focalisant sur le domaine de la complexité paramétrée. Les principaux… (more)

Subjects/Keywords: Complexité Paramétrée; Fpt; Noyaux; Multicoupe; Arbres avec beaucoup de Feuilles; Algorithmes d'Approximation; Parameterized Complexity; Fpt; Kernels; Multicut; Trees with Many Leaves; Approximation Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daligault, J. (2011). Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2011MON20034

Chicago Manual of Style (16th Edition):

Daligault, Jean. “Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.” 2011. Doctoral Dissertation, Université Montpellier II. Accessed December 07, 2019. http://www.theses.fr/2011MON20034.

MLA Handbook (7th Edition):

Daligault, Jean. “Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.” 2011. Web. 07 Dec 2019.

Vancouver:

Daligault J. Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut. [Internet] [Doctoral dissertation]. Université Montpellier II; 2011. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2011MON20034.

Council of Science Editors:

Daligault J. Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. : Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut. [Doctoral Dissertation]. Université Montpellier II; 2011. Available from: http://www.theses.fr/2011MON20034


University of Waterloo

27. Chan, Hubert. A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs.

Degree: 2003, University of Waterloo

 We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the… (more)

Subjects/Keywords: Computer Science; algorithms; graph theory; graph drawing; parameterized complexity; upward planarity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, H. (2003). A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chan, Hubert. “A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs.” 2003. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/1090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chan, Hubert. “A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs.” 2003. Web. 07 Dec 2019.

Vancouver:

Chan H. A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs. [Internet] [Thesis]. University of Waterloo; 2003. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/1090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan H. A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs. [Thesis]. University of Waterloo; 2003. Available from: http://hdl.handle.net/10012/1090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Central Florida

28. Enciso, Rosa. Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs.

Degree: 2009, University of Central Florida

 Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other… (more)

Subjects/Keywords: algorithms; graph theory; parameterized complexity; series-parallel graphs; Computer Sciences; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Enciso, R. (2009). Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/3995

Chicago Manual of Style (16th Edition):

Enciso, Rosa. “Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs.” 2009. Doctoral Dissertation, University of Central Florida. Accessed December 07, 2019. https://stars.library.ucf.edu/etd/3995.

MLA Handbook (7th Edition):

Enciso, Rosa. “Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs.” 2009. Web. 07 Dec 2019.

Vancouver:

Enciso R. Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs. [Internet] [Doctoral dissertation]. University of Central Florida; 2009. [cited 2019 Dec 07]. Available from: https://stars.library.ucf.edu/etd/3995.

Council of Science Editors:

Enciso R. Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-parallel Graphs. [Doctoral Dissertation]. University of Central Florida; 2009. Available from: https://stars.library.ucf.edu/etd/3995


Texas A&M University

29. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/155568.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 07 Dec 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/155568.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

30. Gastineau, Nicolas. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.

Degree: Docteur es, Informatique, 2014, Université de Bourgogne

Nos recherches traitent de coloration de graphes avec des contraintes de distance (coloration de packing) ou des contraintes sur le voisinage (coloration de Grundy). Soit… (more)

Subjects/Keywords: Coloration; Coloration de Grundy; Complexité algorithmique; Complexité paramétrée; Distance; Graphe; Graphe régulier; Coloration de packing; S-coloration de packing; Coloring; Combinatorics; Computational complexity; Distance; Domination; Graph; Regular graph; Grundy coloring; Lattic; Packing coloring; Parameterized complexity; S -packing coloring; 004.6

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gastineau, N. (2014). Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. (Doctoral Dissertation). Université de Bourgogne. Retrieved from http://www.theses.fr/2014DIJOS014

Chicago Manual of Style (16th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Doctoral Dissertation, Université de Bourgogne. Accessed December 07, 2019. http://www.theses.fr/2014DIJOS014.

MLA Handbook (7th Edition):

Gastineau, Nicolas. “Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs.” 2014. Web. 07 Dec 2019.

Vancouver:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Internet] [Doctoral dissertation]. Université de Bourgogne; 2014. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2014DIJOS014.

Council of Science Editors:

Gastineau N. Partitionnement, recouvrement et colorabilité dans les graphes : Partitionability, coverability and colorability in graphs. [Doctoral Dissertation]. Université de Bourgogne; 2014. Available from: http://www.theses.fr/2014DIJOS014

[1] [2]

.