default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Grigoriadis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j14]Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio:
Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM J. Optim. 11(4): 1081-1091 (2001)
1990 – 1999
- 1996
- [j13]Michael D. Grigoriadis, Leonid G. Khachiyan:
Coordination Complexity of Parallel Price-Directive Decomposition. Math. Oper. Res. 21(2): 321-340 (1996) - [j12]Michael D. Grigoriadis, Leonid G. Khachiyan:
Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996) - [j11]Michael D. Grigoriadis, Leonid G. Khachiyan:
An Interior Point Method for Bordered Block-Diagonal Linear Programs. SIAM J. Optim. 6(4): 913-932 (1996) - 1995
- [j10]Michael D. Grigoriadis, Leonid G. Khachiyan:
An exponential-function reduction method for block-angular convex programs. Networks 26(2): 59-68 (1995) - [j9]Michael D. Grigoriadis, Leonid G. Khachiyan:
A sublinear-time randomized approximation algorithm for matrix games. Oper. Res. Lett. 18(2): 53-58 (1995) - 1994
- [j8]Michael D. Grigoriadis, Leonid G. Khachiyan:
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints. SIAM J. Optim. 4(1): 86-107 (1994) - 1991
- [j7]Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan:
Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50: 277-290 (1991)
1980 – 1989
- 1989
- [j6]Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan:
A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18(1): 30-55 (1989) - 1988
- [j5]Michael D. Grigoriadis, Bahman Kalantari:
A new class of heuristic algorithms for weighted perfect matching. J. ACM 35(4): 769-776 (1988) - 1986
- [j4]Michael D. Grigoriadis, Bahman Kalantari:
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986)
1970 – 1979
- 1972
- [j3]Michael D. Grigoriadis, William W. White:
A partitioning algorithm for the multicommodity network flow problem. Math. Program. 3(1): 157-177 (1972) - 1971
- [j2]Michael D. Grigoriadis:
A projective method for structured nonlinear programs. Math. Program. 1(1): 321-358 (1971) - [c1]Michael D. Grigoriadis, L. Papayanopoulos, Kurt Spielberg:
Experimental implementations of mixed integer programming algorithms. ACM Annual Conference 1971: 295-300
1960 – 1969
- 1969
- [j1]Michael D. Grigoriadis, Klaus Ritter:
A Decomposition Method for Structured Linear and Nonlinear Programs. J. Comput. Syst. Sci. 3(4): 335-360 (1969)
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 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
