Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Rice University" +contributor:("Hicks, Illya"). Showing records 1 – 24 of 24 total matches.

Search Limiters

Last 2 Years | English Only

Degrees

Levels

▼ Search Limiters


Rice University

1. Brimkov, Boris. Efficient Computation of Chromatic and Flow Polynomials.

Degree: MA, Engineering, 2015, Rice University

 This thesis surveys chromatic and flow polynomials, and presents new efficient methods to compute these polynomials on specific families of graphs. The chromatic and flow… (more)

Subjects/Keywords: Chromatic polynomial; flow polynomial

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brimkov, B. (2015). Efficient Computation of Chromatic and Flow Polynomials. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/95530

Chicago Manual of Style (16th Edition):

Brimkov, Boris. “Efficient Computation of Chromatic and Flow Polynomials.” 2015. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/95530.

MLA Handbook (7th Edition):

Brimkov, Boris. “Efficient Computation of Chromatic and Flow Polynomials.” 2015. Web. 24 Feb 2021.

Vancouver:

Brimkov B. Efficient Computation of Chromatic and Flow Polynomials. [Internet] [Masters thesis]. Rice University; 2015. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/95530.

Council of Science Editors:

Brimkov B. Efficient Computation of Chromatic and Flow Polynomials. [Masters Thesis]. Rice University; 2015. Available from: http://hdl.handle.net/1911/95530


Rice University

2. Mikesell, Derek Justin. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.

Degree: MA, Engineering, 2016, Rice University

 Given a network G=(V,E), consider the problem of selecting a subset of nodes, A, of a fixed size, k, such that the sum expected walk… (more)

Subjects/Keywords: Graph Theory; Hitting Set; Consensus Model; Spectral; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mikesell, D. J. (2016). A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/95559

Chicago Manual of Style (16th Edition):

Mikesell, Derek Justin. “A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.” 2016. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/95559.

MLA Handbook (7th Edition):

Mikesell, Derek Justin. “A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models.” 2016. Web. 24 Feb 2021.

Vancouver:

Mikesell DJ. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. [Internet] [Masters thesis]. Rice University; 2016. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/95559.

Council of Science Editors:

Mikesell DJ. A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models. [Masters Thesis]. Rice University; 2016. Available from: http://hdl.handle.net/1911/95559


Rice University

3. Fast, Caleb C. Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems.

Degree: PhD, Engineering, 2017, Rice University

 This thesis presents new methods for solving two graph location problems, the p-Median problem and the zero-forcing problem. For the p-median problem, I present a… (more)

Subjects/Keywords: p-median; zero forcing; integer programming; branch decomposition; branchwidth; facility location; propagation time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fast, C. C. (2017). Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96074

Chicago Manual of Style (16th Edition):

Fast, Caleb C. “Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems.” 2017. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/96074.

MLA Handbook (7th Edition):

Fast, Caleb C. “Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems.” 2017. Web. 24 Feb 2021.

Vancouver:

Fast CC. Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/96074.

Council of Science Editors:

Fast CC. Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96074


Rice University

4. Becker, Timothy. Bilevel Clique Interdiction and Related Problems.

Degree: PhD, Engineering, 2017, Rice University

 I introduce a formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction… (more)

Subjects/Keywords: Graph Theory; Integer Programming; Bilevel Programming; Interdiction; Column Generation; Facets; Valid Inequalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Becker, T. (2017). Bilevel Clique Interdiction and Related Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96109

Chicago Manual of Style (16th Edition):

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/96109.

MLA Handbook (7th Edition):

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Web. 24 Feb 2021.

Vancouver:

Becker T. Bilevel Clique Interdiction and Related Problems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/96109.

Council of Science Editors:

Becker T. Bilevel Clique Interdiction and Related Problems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96109


Rice University

5. Mikesell, Derek Justin. Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination.

Degree: PhD, Engineering, 2019, Rice University

 This thesis will cover various computational models for approximating and solving multiple graph monitoring problems. The first problem of interest is the Minimum k-core problem,… (more)

Subjects/Keywords: k-core; zero forcing; power domination; integer programming; branch and cut; boolean satisfiability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mikesell, D. J. (2019). Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/107457

Chicago Manual of Style (16th Edition):

Mikesell, Derek Justin. “Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination.” 2019. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/107457.

MLA Handbook (7th Edition):

Mikesell, Derek Justin. “Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination.” 2019. Web. 24 Feb 2021.

Vancouver:

Mikesell DJ. Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination. [Internet] [Doctoral dissertation]. Rice University; 2019. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/107457.

Council of Science Editors:

Mikesell DJ. Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination. [Doctoral Dissertation]. Rice University; 2019. Available from: http://hdl.handle.net/1911/107457


Rice University

6. Wood, Cynthia Ivette. Clique Generalizations and Related Problems.

Degree: PhD, Engineering, 2016, Rice University

 A large number of real-world problems can be model as optimization problems in graphs. The clique model was introduced to aid the study of network… (more)

Subjects/Keywords: Cliques; Clique Generalizations; k-core; minimum k-core; minimal k-core; k-plex; co-k-plex; cell assembly; k-assembly; memory; graph analytics; graph Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wood, C. I. (2016). Clique Generalizations and Related Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96187

Chicago Manual of Style (16th Edition):

Wood, Cynthia Ivette. “Clique Generalizations and Related Problems.” 2016. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/96187.

MLA Handbook (7th Edition):

Wood, Cynthia Ivette. “Clique Generalizations and Related Problems.” 2016. Web. 24 Feb 2021.

Vancouver:

Wood CI. Clique Generalizations and Related Problems. [Internet] [Doctoral dissertation]. Rice University; 2016. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/96187.

Council of Science Editors:

Wood CI. Clique Generalizations and Related Problems. [Doctoral Dissertation]. Rice University; 2016. Available from: http://hdl.handle.net/1911/96187


Rice University

7. Arellano, John David. Cocircuits of vector matroids.

Degree: MA, Engineering, 2012, Rice University

 In this thesis, I present a set covering problem (SCP) formulation of the matroid cogirth problem, finding the cardinality of the smallest cocircuit of a… (more)

Subjects/Keywords: Applied sciences; Applied mathematics; Operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arellano, J. D. (2012). Cocircuits of vector matroids. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/70203

Chicago Manual of Style (16th Edition):

Arellano, John David. “Cocircuits of vector matroids.” 2012. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/70203.

MLA Handbook (7th Edition):

Arellano, John David. “Cocircuits of vector matroids.” 2012. Web. 24 Feb 2021.

Vancouver:

Arellano JD. Cocircuits of vector matroids. [Internet] [Masters thesis]. Rice University; 2012. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/70203.

Council of Science Editors:

Arellano JD. Cocircuits of vector matroids. [Masters Thesis]. Rice University; 2012. Available from: http://hdl.handle.net/1911/70203


Rice University

8. Leong, Oscar. Phase Retrieval Under a Generative Prior.

Degree: MA, Engineering, 2019, Rice University

 The phase retrieval problem, arising from X-ray crystallography and medical imaging, asks to recover a signal given intensity-only measurements. When the number of measurements is… (more)

Subjects/Keywords: Phase Retrieval; Generative Models; Non-convex Optimization; Deep Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leong, O. (2019). Phase Retrieval Under a Generative Prior. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105890

Chicago Manual of Style (16th Edition):

Leong, Oscar. “Phase Retrieval Under a Generative Prior.” 2019. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/105890.

MLA Handbook (7th Edition):

Leong, Oscar. “Phase Retrieval Under a Generative Prior.” 2019. Web. 24 Feb 2021.

Vancouver:

Leong O. Phase Retrieval Under a Generative Prior. [Internet] [Masters thesis]. Rice University; 2019. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/105890.

Council of Science Editors:

Leong O. Phase Retrieval Under a Generative Prior. [Masters Thesis]. Rice University; 2019. Available from: http://hdl.handle.net/1911/105890


Rice University

9. Becker, Timothy J. A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem.

Degree: MA, Engineering, 2015, Rice University

 I introduce an algorithm to solve the current formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources.… (more)

Subjects/Keywords: Clique; Interdiction; Branch-and-Cut; Graph Theory; Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Becker, T. J. (2015). A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/87748

Chicago Manual of Style (16th Edition):

Becker, Timothy J. “A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem.” 2015. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/87748.

MLA Handbook (7th Edition):

Becker, Timothy J. “A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem.” 2015. Web. 24 Feb 2021.

Vancouver:

Becker TJ. A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem. [Internet] [Masters thesis]. Rice University; 2015. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/87748.

Council of Science Editors:

Becker TJ. A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem. [Masters Thesis]. Rice University; 2015. Available from: http://hdl.handle.net/1911/87748


Rice University

10. Davila, Randy R. Bounding the Forcing Number of a Graph.

Degree: MA, Engineering, 2015, Rice University

 The forcing number, denoted F(G), is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the simple… (more)

Subjects/Keywords: Zero Forcing Number; k-Forcing Number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davila, R. R. (2015). Bounding the Forcing Number of a Graph. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/87761

Chicago Manual of Style (16th Edition):

Davila, Randy R. “Bounding the Forcing Number of a Graph.” 2015. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/87761.

MLA Handbook (7th Edition):

Davila, Randy R. “Bounding the Forcing Number of a Graph.” 2015. Web. 24 Feb 2021.

Vancouver:

Davila RR. Bounding the Forcing Number of a Graph. [Internet] [Masters thesis]. Rice University; 2015. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/87761.

Council of Science Editors:

Davila RR. Bounding the Forcing Number of a Graph. [Masters Thesis]. Rice University; 2015. Available from: http://hdl.handle.net/1911/87761


Rice University

11. Young, Joseph. Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents.

Degree: PhD, Engineering, 2013, Rice University

 Nanostructures have attracted substantial attention due to their distinctive properties and various applications. Nanostructures consisting of multiple morphologies and/or materials have recently become the focus… (more)

Subjects/Keywords: Theranostics; Nanoparticles; Photothermal; Chalcogenide; Nanocrystals; Nanoshells; Magnetic resonance imaging (MRI)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Young, J. (2013). Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/77592

Chicago Manual of Style (16th Edition):

Young, Joseph. “Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents.” 2013. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/77592.

MLA Handbook (7th Edition):

Young, Joseph. “Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents.” 2013. Web. 24 Feb 2021.

Vancouver:

Young J. Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents. [Internet] [Doctoral dissertation]. Rice University; 2013. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/77592.

Council of Science Editors:

Young J. Complexed Multifunctional Metallic and Chalcogenide Nanostructures as Theranostic Agents. [Doctoral Dissertation]. Rice University; 2013. Available from: http://hdl.handle.net/1911/77592


Rice University

12. Wood, Cynthia. The Closure of the Minimal k-core Problem for Modeling k-assemblies.

Degree: MA, Engineering, 2013, Rice University

 In this thesis, I present a backtracking algorithm to find all minimal k-cores of a given undirected graph, which belongs to the class of NP-hard… (more)

Subjects/Keywords: K-cores; Cell assembly; K-assembly; Clique generalizations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wood, C. (2013). The Closure of the Minimal k-core Problem for Modeling k-assemblies. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/77595

Chicago Manual of Style (16th Edition):

Wood, Cynthia. “The Closure of the Minimal k-core Problem for Modeling k-assemblies.” 2013. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/77595.

MLA Handbook (7th Edition):

Wood, Cynthia. “The Closure of the Minimal k-core Problem for Modeling k-assemblies.” 2013. Web. 24 Feb 2021.

Vancouver:

Wood C. The Closure of the Minimal k-core Problem for Modeling k-assemblies. [Internet] [Masters thesis]. Rice University; 2013. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/77595.

Council of Science Editors:

Wood C. The Closure of the Minimal k-core Problem for Modeling k-assemblies. [Masters Thesis]. Rice University; 2013. Available from: http://hdl.handle.net/1911/77595


Rice University

13. Lee, Seoung Kyou. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.

Degree: PhD, Engineering, 2015, Rice University

 Many tasks, such as search and rescue, exploration and mapping, security and surveil- lance are suited for mobile robots. These tasks require the population to… (more)

Subjects/Keywords: Multi-Robot System; Coverage Control; Swarm Intelligence; Distributed Algorithm; Computational Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, S. K. (2015). Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87809

Chicago Manual of Style (16th Edition):

Lee, Seoung Kyou. “Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.” 2015. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/87809.

MLA Handbook (7th Edition):

Lee, Seoung Kyou. “Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.” 2015. Web. 24 Feb 2021.

Vancouver:

Lee SK. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. [Internet] [Doctoral dissertation]. Rice University; 2015. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/87809.

Council of Science Editors:

Lee SK. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. [Doctoral Dissertation]. Rice University; 2015. Available from: http://hdl.handle.net/1911/87809

14. Bell, Nick. A Branch and Cut Approach to the Feedback Vertex Set Problem.

Degree: MA, Engineering, 2018, Rice University

 In this thesis, I use a branch and cut implementation to solve the feedback vertex set problem and add new facet defining inequalities to the… (more)

Subjects/Keywords: Branch and Cut; Feedback Vertex Set; Graph Theory; Combinatorial Optimization; Facet

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

Bell, N. (2018). A Branch and Cut Approach to the Feedback Vertex Set Problem. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105909

Chicago Manual of Style (16th Edition):

Bell, Nick. “A Branch and Cut Approach to the Feedback Vertex Set Problem.” 2018. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/105909.

MLA Handbook (7th Edition):

Bell, Nick. “A Branch and Cut Approach to the Feedback Vertex Set Problem.” 2018. Web. 24 Feb 2021.

Vancouver:

Bell N. A Branch and Cut Approach to the Feedback Vertex Set Problem. [Internet] [Masters thesis]. Rice University; 2018. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/105909.

Council of Science Editors:

Bell N. A Branch and Cut Approach to the Feedback Vertex Set Problem. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105909

15. Smith, Logan. Fort Neighborhoods: A Set Cover Formulation for Power Domination.

Degree: MA, Engineering, 2018, Rice University

 This thesis introduces a novel separation algorithm for calculating power domination numbers and minimum power dominating sets in graphs. Additionally, it shows how the existence… (more)

Subjects/Keywords: Combinatorial Optimization; Graph Theory; Discrete Mathematics

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

Smith, L. (2018). Fort Neighborhoods: A Set Cover Formulation for Power Domination. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105803

Chicago Manual of Style (16th Edition):

Smith, Logan. “Fort Neighborhoods: A Set Cover Formulation for Power Domination.” 2018. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/105803.

MLA Handbook (7th Edition):

Smith, Logan. “Fort Neighborhoods: A Set Cover Formulation for Power Domination.” 2018. Web. 24 Feb 2021.

Vancouver:

Smith L. Fort Neighborhoods: A Set Cover Formulation for Power Domination. [Internet] [Masters thesis]. Rice University; 2018. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/105803.

Council of Science Editors:

Smith L. Fort Neighborhoods: A Set Cover Formulation for Power Domination. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105803

16. Ma, Jing. Branch-decomposition heuristics for linear matroids.

Degree: MA, Natural Sciences, 2010, Rice University

 This thesis present two new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch-decompositions for linear matroids. In the literature, there are… (more)

Subjects/Keywords: Applied mathematics; Mathematics

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, J. (2010). Branch-decomposition heuristics for linear matroids. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/62192

Chicago Manual of Style (16th Edition):

Ma, Jing. “Branch-decomposition heuristics for linear matroids.” 2010. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/62192.

MLA Handbook (7th Edition):

Ma, Jing. “Branch-decomposition heuristics for linear matroids.” 2010. Web. 24 Feb 2021.

Vancouver:

Ma J. Branch-decomposition heuristics for linear matroids. [Internet] [Masters thesis]. Rice University; 2010. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/62192.

Council of Science Editors:

Ma J. Branch-decomposition heuristics for linear matroids. [Masters Thesis]. Rice University; 2010. Available from: http://hdl.handle.net/1911/62192

17. Brimkov, Boris. Graph Coloring, Zero Forcing, and Related Problems.

Degree: PhD, Engineering, 2017, Rice University

 This thesis investigates several problems related to classical and dynamic coloring of graphs, and enumeration of graph attributes. In the first part of the thesis,… (more)

Subjects/Keywords: Chromatic polynomial; flow polynomial; zero forcing; connected forcing

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

Brimkov, B. (2017). Graph Coloring, Zero Forcing, and Related Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/105481

Chicago Manual of Style (16th Edition):

Brimkov, Boris. “Graph Coloring, Zero Forcing, and Related Problems.” 2017. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/105481.

MLA Handbook (7th Edition):

Brimkov, Boris. “Graph Coloring, Zero Forcing, and Related Problems.” 2017. Web. 24 Feb 2021.

Vancouver:

Brimkov B. Graph Coloring, Zero Forcing, and Related Problems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/105481.

Council of Science Editors:

Brimkov B. Graph Coloring, Zero Forcing, and Related Problems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/105481


Rice University

18. Arellano, John David. Algorithms to Find the Girth and Cogirth of a Linear Matroid.

Degree: PhD, Engineering, 2014, Rice University

 In this thesis, I present algorithms to find the cogirth and girth, the cardinality of the smallest cocircuit and circuit respectively, of a linear matroid.… (more)

Subjects/Keywords: set covering; linear matroid; cogirth; girth

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arellano, J. D. (2014). Algorithms to Find the Girth and Cogirth of a Linear Matroid. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87699

Chicago Manual of Style (16th Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/87699.

MLA Handbook (7th Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Web. 24 Feb 2021.

Vancouver:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/87699.

Council of Science Editors:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87699


Rice University

19. Yin, Bei. Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application.

Degree: PhD, Engineering, 2014, Rice University

 Massive (or large-scale) MIMO is an emerging technology to improve the spectral efficiency of existing (small-scale) MIMO wireless communication systems. The main idea is to… (more)

Subjects/Keywords: Massive MIMO; Large-scale MIMO; detection; precoding; VLSI; Neumann; conjugate gradient; least square

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yin, B. (2014). Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87787

Chicago Manual of Style (16th Edition):

Yin, Bei. “Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application.” 2014. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/87787.

MLA Handbook (7th Edition):

Yin, Bei. “Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application.” 2014. Web. 24 Feb 2021.

Vancouver:

Yin B. Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/87787.

Council of Science Editors:

Yin B. Low Complexity Detection and Precoding for Massive MIMO Systems: Algorithm, Architecture, and Application. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87787

20. Joshi, Babhru. Blind Demodulation via Convex and Non-Convex Programming.

Degree: PhD, Engineering, 2019, Rice University

 We consider the bilinear inverse problem of recovering two vectors, x and w, in \RL from their entrywise product. In this dissertation, we consider three… (more)

Subjects/Keywords: Blind Demodulation; Convex programming; Non-convex programming; Sparsity; Convex relaxation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joshi, B. (2019). Blind Demodulation via Convex and Non-Convex Programming. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/106016

Chicago Manual of Style (16th Edition):

Joshi, Babhru. “Blind Demodulation via Convex and Non-Convex Programming.” 2019. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/106016.

MLA Handbook (7th Edition):

Joshi, Babhru. “Blind Demodulation via Convex and Non-Convex Programming.” 2019. Web. 24 Feb 2021.

Vancouver:

Joshi B. Blind Demodulation via Convex and Non-Convex Programming. [Internet] [Doctoral dissertation]. Rice University; 2019. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/106016.

Council of Science Editors:

Joshi B. Blind Demodulation via Convex and Non-Convex Programming. [Doctoral Dissertation]. Rice University; 2019. Available from: http://hdl.handle.net/1911/106016


Rice University

21. McClosky, Benjamin. Independence systems and stable set relaxations.

Degree: PhD, Natural Sciences, 2008, Rice University

 Many fundamental combinatorial optimization problems involve the search for subsets of graph elements which satisfy some notion of independence. This thesis develops techniques for optimizing… (more)

Subjects/Keywords: Operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McClosky, B. (2008). Independence systems and stable set relaxations. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/22172

Chicago Manual of Style (16th Edition):

McClosky, Benjamin. “Independence systems and stable set relaxations.” 2008. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/22172.

MLA Handbook (7th Edition):

McClosky, Benjamin. “Independence systems and stable set relaxations.” 2008. Web. 24 Feb 2021.

Vancouver:

McClosky B. Independence systems and stable set relaxations. [Internet] [Doctoral dissertation]. Rice University; 2008. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/22172.

Council of Science Editors:

McClosky B. Independence systems and stable set relaxations. [Doctoral Dissertation]. Rice University; 2008. Available from: http://hdl.handle.net/1911/22172

22. Cooper, James Michael. Two mod-p Johnson filtrations.

Degree: PhD, Natural Sciences, 2014, Rice University

 We consider two mod-p central series of the free group given by Stallings and Zassenhaus. Applying these series to definitions of Dennis Johnson's filtration of… (more)

Subjects/Keywords: Geometric topology; Group theory; Mapping class groups

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

Cooper, J. M. (2014). Two mod-p Johnson filtrations. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/76394

Chicago Manual of Style (16th Edition):

Cooper, James Michael. “Two mod-p Johnson filtrations.” 2014. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/76394.

MLA Handbook (7th Edition):

Cooper, James Michael. “Two mod-p Johnson filtrations.” 2014. Web. 24 Feb 2021.

Vancouver:

Cooper JM. Two mod-p Johnson filtrations. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/76394.

Council of Science Editors:

Cooper JM. Two mod-p Johnson filtrations. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/76394

23. Fast, Caleb. On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs.

Degree: MA, Engineering, 2014, Rice University

 This thesis provides new bounds on the strength of the subtour relaxation of the Traveling Salesman Problem (TSP) for fractional 2-matching cost instances whose support… (more)

Subjects/Keywords: Traveling salesman problem (TSP); Fractional 2-matching instance; Subtour elimination; 4/3 conjecture; Integrality gap; Applied mathematics

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

Fast, C. (2014). On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/76721

Chicago Manual of Style (16th Edition):

Fast, Caleb. “On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs.” 2014. Masters Thesis, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/76721.

MLA Handbook (7th Edition):

Fast, Caleb. “On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs.” 2014. Web. 24 Feb 2021.

Vancouver:

Fast C. On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs. [Internet] [Masters thesis]. Rice University; 2014. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/76721.

Council of Science Editors:

Fast C. On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs. [Masters Thesis]. Rice University; 2014. Available from: http://hdl.handle.net/1911/76721

24. Santacruz, Pedro. Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views.

Degree: PhD, Engineering, 2013, Rice University

 In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited… (more)

Subjects/Keywords: Wireless communication; Wireless networks; Distributed scheduling; Local views

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Santacruz, P. (2013). Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/72036

Chicago Manual of Style (16th Edition):

Santacruz, Pedro. “Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views.” 2013. Doctoral Dissertation, Rice University. Accessed February 24, 2021. http://hdl.handle.net/1911/72036.

MLA Handbook (7th Edition):

Santacruz, Pedro. “Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views.” 2013. Web. 24 Feb 2021.

Vancouver:

Santacruz P. Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views. [Internet] [Doctoral dissertation]. Rice University; 2013. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1911/72036.

Council of Science Editors:

Santacruz P. Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views. [Doctoral Dissertation]. Rice University; 2013. Available from: http://hdl.handle.net/1911/72036

.