Остановите войну!
for scientists:
default search action
Prabhu Manyem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i8]Prabhu Manyem:
Maximum independent set (stable set) problem: A mathematical programming model with valid inequalities and computational testing. CoRR abs/2206.12531 (2022)
2010 – 2019
- 2018
- [j6]Prabhu Manyem:
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms. Discret. Appl. Math. 242: 102-117 (2018) - 2014
- [i7]Prabhu Manyem:
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique. CoRR abs/1407.1403 (2014) - 2012
- [i6]Prabhu Manyem, Julien Ugon:
Computational Complexity, NP Completeness and Optimization Duality: A Survey. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i5]Prabhu Manyem:
Nearly identical BFC expressions and identical OFC expressions for Matching and Clique. CoRR abs/1106.4606 (2011) - 2010
- [i4]Prabhu Manyem:
Duality Gap, Computational Complexity and NP Completeness: A Survey. CoRR abs/1012.5568 (2010)
2000 – 2009
- 2009
- [e2]Rod Downey, Prabhu Manyem:
Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. CRPIT 94, Australian Computer Society 2009, ISBN 978-1-920682-75-0 [contents] - [i3]Prabhu Manyem:
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions. CoRR abs/0904.4331 (2009) - 2008
- [j5]Prabhu Manyem:
Syntactic Characterizations of Polynomial Time Optimization Classes. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j4]Orestes Bueno, Prabhu Manyem:
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy. Fundam. Informaticae 84(1): 111-133 (2008) - [e1]James Harland, Prabhu Manyem:
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings. CRPIT 77, Australian Computer Society 2008, ISBN 978-1-920682-58-3 [contents] - 2006
- [i2]Prabhu Manyem:
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes). CoRR abs/cs/0606050 (2006) - [i1]Prabhu Manyem:
Polynomial-Time Maximisation Classes: Syntactic Hierarchy. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j3]Luke Finlay, Prabhu Manyem:
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing. RAIRO Oper. Res. 39(3): 163-183 (2005) - 2003
- [j2]Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser:
Approximation Lower Bounds in Online LIB Bin Packing and Covering. J. Autom. Lang. Comb. 8(4): 663-674 (2003) - 2001
- [j1]Jerzy A. Filar, Prabhu Manyem, Kevin White:
How Airlines and Airports Recover from Schedule Perturbations: A Survey. Ann. Oper. Res. 108(1-4): 315-333 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint