×

zbMATH — the first resource for mathematics

Megiddo, Nimrod

Compute Distance To:
Author ID: megiddo.nimrod Recent zbMATH articles by "Megiddo, Nimrod"
Published as: Megiddo, N.; Megiddo, Nimrod
Documents Indexed: 115 Publications since 1971, including 6 Books

Publications by Year

Citations contained in zbMATH Open

101 Publications have been cited 2,608 times in 2,066 Documents Cited by Year
Linear-time algorithms for linear programming in \(R^ 3\) and related problems. Zbl 0521.68034
Megiddo, Nimrod
216
1983
A unified approach to interior point algorithms for linear complementarity problems: A summary. Zbl 0745.90069
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito; Yoshise, Akiko
177
1991
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
160
1983
On the complexity of some common geometric location problems. Zbl 0534.68032
Megiddo, Nimrod; Supowit, Kenneth J.
146
1984
Combinatorial optimization with rational objective functions. Zbl 0425.90076
Megiddo, Nimrod
137
1979
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
133
1984
A logic for reasoning about probabilities. Zbl 0811.03014
Fagin, Ronald; Halpern, Joseph Y.; Megiddo, Nimrod
112
1990
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
103
1988
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
97
1993
Pathways to the optimal set in linear programming. Zbl 0687.90056
Megiddo, Nimrod
62
1989
Computational complexity of the game theory approach to cost allocation for a tree. Zbl 0397.90111
Megiddo, Nimrod
59
1978
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
Kojima, Masakazu (ed.); Megiddo, Nimrod (ed.); Noma, Toshihito (ed.); Yoshise, Akiko (ed.)
51
1991
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
48
1989
Progress in mathematical programming. Interior-point and related methods. (Based on the conference held at Pacific Grove, California, March 1-4, 1987). Zbl 0669.00026
Megiddo, Nimrod (ed.)
46
1989
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
45
1991
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
43
1974
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
42
1983
An O(n \(log^ 2\) n) algorithm for the kth longest path in a tree with applications to location problems. Zbl 0456.68071
Megiddo, N.; Tamir, A.; Zemel, E.; Chandrasekaran, R.
41
1981
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
39
1983
On total functions, existence theorems and computational complexity. Zbl 0731.68036
Megiddo, Nimrod; Papadimitriou, Christos H.
37
1991
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
34
1993
An interior point potential reduction algorithm for the linear complementarity problem. Zbl 0764.90083
Kojima, Masakazu; Megiddo, Nimrod; Ye, Yinyu
34
1992
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
34
1982
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
30
1991
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
30
1988
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
29
1983
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
25
1985
Towards a genuinely polynomial algorithm for linear programming. Zbl 0532.90061
Megiddo, Nimrod
25
1983
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
23
1991
Efficient computation of equilibria for extensive two-person games. Zbl 0859.90127
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
22
1996
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
21
1992
Computing circular separability. Zbl 0598.52008
O’Rourke, Joseph; Kosaraju, S. Rao; Megiddo, Nimrod
20
1986
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
20
1978
On the existence and uniqueness of solutions in nonlinear complementarity theory. Zbl 0363.90102
Megiddo, Nimrod; Kojima, Masakazu
18
1977
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
16
1993
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
16
1989
On finding a minimum dominating set in a tournament. Zbl 0661.68064
Megiddo, Nimrod; Vishkin, Uzi
16
1988
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Zbl 0634.65044
Adler, Ilan; Megiddo, Nimrod
15
1985
Finding least-distance lines. Zbl 0517.05007
Megiddo, Nimrod; Tamir, Arie
14
1983
Partial and complete cyclic orders. Zbl 0361.06001
Megiddo, Nimrod
14
1976
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
13
1993
On the complexity of some geometric problems in unbounded dimension. Zbl 0717.68046
Megiddo, Nimrod
13
1990
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod
13
1979
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
13
1978
A good algorithm for lexicographically optimal flows in multiterminal networks. Zbl 0354.90083
Megiddo, Nimrod
13
1977
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
12
2001
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
12
1994
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
12
1994
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
12
1993
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
11
1993
A monotone complementarity problem with feasible solutions but no complementary solutions. Zbl 0353.90084
Megiddo, Nimrod
11
1977
On the complexity of linear programming. Zbl 0735.90044
Megiddo, Nimrod
10
1989
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
10
1986
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
10
1986
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
10
1985
Using fast matrix multiplication to find basic solutions. Zbl 0913.68079
Beling, Peter A.; Megiddo, Nimrod
9
1998
On the \(\epsilon\)-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
9
1989
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
9
1989
On repeated games with incomplete information played by non-Bayesian players. Zbl 0441.90118
Megiddo, N.
9
1980
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Zbl 0782.68053
Cohen, Edith; Megiddo, Nimrod
8
1993
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. Zbl 0618.90061
Megiddo, Nimrod
8
1986
On the parametric nonlinear complementarity problem. Zbl 0379.90094
Megiddo, Nimrod
8
1978
On the geometric separability of Boolean functions. Zbl 0854.68034
Hegedüs, Tibor; Megiddo, Nimrod
7
1996
An 0(n log n) randomizing algorithm for the weighted Euclidean 1-center problem. Zbl 0612.90033
Megiddo, Nimrod; Zemel, Eitan
7
1986
Recognizing properties of periodic graphs. Zbl 0753.05047
Cohen, Edith; Megiddo, Nimrod
6
1991
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
6
1986
A note on the generality of the self-dual algorithm with various starting points. Zbl 0561.90063
Megiddo, Nimrod
6
1985
Mixtures of order matrices and generalized order matrices. Zbl 0377.05008
Megiddo, Nimrod
6
1977
A modified layered-step interior-point algorithm for linear programming. Zbl 0920.90098
Megiddo, Nimrod; Mizuno, Shinji; Tsuchiya, Takashi
5
1998
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
5
1994
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
5
1994
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
5
1984
Finding mixed strategies with small supports in extensive form games. Zbl 0856.90143
Koller, Daphne; Megiddo, Nimrod
4
1996
Constructing small sample spaces satisfying given constraints. Zbl 1310.68153
Koller, Daphne; Megiddo, Nimrod
4
1993
Exact computation of optimal inventory policies over an unbounded horizon. Zbl 0744.90021
Hassin, Refael; Megiddo, Nimrod
4
1991
Combinatorial optimization with rational objective functions. Zbl 1282.68141
Megiddo, Nimrod
4
1978
On monotonicity in parametric linear complementarity problems. Zbl 0367.90106
Megiddo, Nimrod
4
1977
A general NP-completeness theorem. Zbl 0815.68055
Megiddo, Nimrod
3
1993
On solving the linear programming problem approximately. Zbl 0747.90065
Megiddo, Nimrod
3
1990
On computable beliefs of rational machines. Zbl 0755.90106
Megiddo, Nimrod
3
1989
An optimal algorithm for finding all the jumps of a monotone step- function. Zbl 0593.68037
Hassin, Refael; Megiddo, Nimrod
3
1985
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
3
1982
Path independent choices. Zbl 0431.90008
Kalai, Ehud; Megiddo, Nimrod
3
1980
Nucleoluses of compound simple games. Zbl 0254.90065
Megiddo, Nimrod
3
1974
Online learning with prior knowledge. Zbl 1203.68152
Hazan, Elad; Megiddo, Nimrod
2
2007
Combining expert advice in reactive environments. Zbl 1326.68268
Pucci de Farias, Daniela; Megiddo, Nimrod
2
2006
A sublinear parallel algorithm for stable matching. Zbl 0961.90088
Feder, Tomás; Megiddo, Nimrod; Plotkin, Serge A.
2
2000
A linear programming instance with many crossover events. Zbl 0869.90049
Mizuno, Shinji; Megiddo, Nimrod; Tsuchiya, Takashi
2
1996
A deterministic poly\((\log\log n)\)-time \(n\)-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
2
1996
A note on approximate linear programming. Zbl 0762.90051
Megiddo, Nimrod
2
1992
The kernel and the nucleolus of a product of simple games. Zbl 0208.23006
Megiddo, N.
2
1971
Equilibrium in prediction markets with buyers and sellers. Zbl 1202.91112
Agrawal, Shipra; Megiddo, Nimrod; Armbruster, Benjamin
1
2010
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1
1997
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1
1994
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1
1994
The relation between the path of centers and Smale’s regularization of the linear programming problem. Zbl 0727.65053
Kojima, Masakazu; Megiddo, Nimrod
1
1991
A two-resource allocation problem solvable in linear time. Zbl 0564.90025
Megiddo, Nimrod; Ichimori, Tetsuo
1
1985
An application of parallel computation to sequential computation: the problem of cost-effective resource allocation. Zbl 0458.68005
Megiddo, Nimrod
1
1981
On Fulkerson’s conjecture about consistent labeling processes. Zbl 0443.90107
Megiddo, Nimrod; Galil, Zvi
1
1979
An \(O(N\cdot \log N)\) algorithm for a class of matching problems. Zbl 0375.68021
Megiddo, Nimrod; Tamir, Arie
1
1978
Equilibrium in prediction markets with buyers and sellers. Zbl 1202.91112
Agrawal, Shipra; Megiddo, Nimrod; Armbruster, Benjamin
1
2010
Online learning with prior knowledge. Zbl 1203.68152
Hazan, Elad; Megiddo, Nimrod
2
2007
Combining expert advice in reactive environments. Zbl 1326.68268
Pucci de Farias, Daniela; Megiddo, Nimrod
2
2006
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
12
2001
A sublinear parallel algorithm for stable matching. Zbl 0961.90088
Feder, Tomás; Megiddo, Nimrod; Plotkin, Serge A.
2
2000
Using fast matrix multiplication to find basic solutions. Zbl 0913.68079
Beling, Peter A.; Megiddo, Nimrod
9
1998
A modified layered-step interior-point algorithm for linear programming. Zbl 0920.90098
Megiddo, Nimrod; Mizuno, Shinji; Tsuchiya, Takashi
5
1998
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1
1997
Efficient computation of equilibria for extensive two-person games. Zbl 0859.90127
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
22
1996
On the geometric separability of Boolean functions. Zbl 0854.68034
Hegedüs, Tibor; Megiddo, Nimrod
7
1996
Finding mixed strategies with small supports in extensive form games. Zbl 0856.90143
Koller, Daphne; Megiddo, Nimrod
4
1996
A linear programming instance with many crossover events. Zbl 0869.90049
Mizuno, Shinji; Megiddo, Nimrod; Tsuchiya, Takashi
2
1996
A deterministic poly\((\log\log n)\)-time \(n\)-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
2
1996
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
12
1994
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
12
1994
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
5
1994
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
5
1994
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1
1994
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1
1994
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
97
1993
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
34
1993
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
16
1993
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
13
1993
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
12
1993
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
11
1993
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Zbl 0782.68053
Cohen, Edith; Megiddo, Nimrod
8
1993
Constructing small sample spaces satisfying given constraints. Zbl 1310.68153
Koller, Daphne; Megiddo, Nimrod
4
1993
A general NP-completeness theorem. Zbl 0815.68055
Megiddo, Nimrod
3
1993
An interior point potential reduction algorithm for the linear complementarity problem. Zbl 0764.90083
Kojima, Masakazu; Megiddo, Nimrod; Ye, Yinyu
34
1992
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
21
1992
A note on approximate linear programming. Zbl 0762.90051
Megiddo, Nimrod
2
1992
A unified approach to interior point algorithms for linear complementarity problems: A summary. Zbl 0745.90069
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito; Yoshise, Akiko
177
1991
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
Kojima, Masakazu (ed.); Megiddo, Nimrod (ed.); Noma, Toshihito (ed.); Yoshise, Akiko (ed.)
51
1991
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
45
1991
On total functions, existence theorems and computational complexity. Zbl 0731.68036
Megiddo, Nimrod; Papadimitriou, Christos H.
37
1991
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
30
1991
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
23
1991
Recognizing properties of periodic graphs. Zbl 0753.05047
Cohen, Edith; Megiddo, Nimrod
6
1991
Exact computation of optimal inventory policies over an unbounded horizon. Zbl 0744.90021
Hassin, Refael; Megiddo, Nimrod
4
1991
The relation between the path of centers and Smale’s regularization of the linear programming problem. Zbl 0727.65053
Kojima, Masakazu; Megiddo, Nimrod
1
1991
A logic for reasoning about probabilities. Zbl 0811.03014
Fagin, Ronald; Halpern, Joseph Y.; Megiddo, Nimrod
112
1990
On the complexity of some geometric problems in unbounded dimension. Zbl 0717.68046
Megiddo, Nimrod
13
1990
On solving the linear programming problem approximately. Zbl 0747.90065
Megiddo, Nimrod
3
1990
Pathways to the optimal set in linear programming. Zbl 0687.90056
Megiddo, Nimrod
62
1989
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
48
1989
Progress in mathematical programming. Interior-point and related methods. (Based on the conference held at Pacific Grove, California, March 1-4, 1987). Zbl 0669.00026
Megiddo, Nimrod (ed.)
46
1989
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
16
1989
On the complexity of linear programming. Zbl 0735.90044
Megiddo, Nimrod
10
1989
On the \(\epsilon\)-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
9
1989
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
9
1989
On computable beliefs of rational machines. Zbl 0755.90106
Megiddo, Nimrod
3
1989
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
103
1988
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
30
1988
On finding a minimum dominating set in a tournament. Zbl 0661.68064
Megiddo, Nimrod; Vishkin, Uzi
16
1988
Computing circular separability. Zbl 0598.52008
O’Rourke, Joseph; Kosaraju, S. Rao; Megiddo, Nimrod
20
1986
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
10
1986
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
10
1986
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. Zbl 0618.90061
Megiddo, Nimrod
8
1986
An 0(n log n) randomizing algorithm for the weighted Euclidean 1-center problem. Zbl 0612.90033
Megiddo, Nimrod; Zemel, Eitan
7
1986
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
6
1986
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
25
1985
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Zbl 0634.65044
Adler, Ilan; Megiddo, Nimrod
15
1985
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
10
1985
A note on the generality of the self-dual algorithm with various starting points. Zbl 0561.90063
Megiddo, Nimrod
6
1985
An optimal algorithm for finding all the jumps of a monotone step- function. Zbl 0593.68037
Hassin, Refael; Megiddo, Nimrod
3
1985
A two-resource allocation problem solvable in linear time. Zbl 0564.90025
Megiddo, Nimrod; Ichimori, Tetsuo
1
1985
On the complexity of some common geometric location problems. Zbl 0534.68032
Megiddo, Nimrod; Supowit, Kenneth J.
146
1984
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
133
1984
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
5
1984
Linear-time algorithms for linear programming in \(R^ 3\) and related problems. Zbl 0521.68034
Megiddo, Nimrod
216
1983
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
160
1983
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
42
1983
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
39
1983
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
29
1983
Towards a genuinely polynomial algorithm for linear programming. Zbl 0532.90061
Megiddo, Nimrod
25
1983
Finding least-distance lines. Zbl 0517.05007
Megiddo, Nimrod; Tamir, Arie
14
1983
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
34
1982
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
3
1982
An O(n \(log^ 2\) n) algorithm for the kth longest path in a tree with applications to location problems. Zbl 0456.68071
Megiddo, N.; Tamir, A.; Zemel, E.; Chandrasekaran, R.
41
1981
An application of parallel computation to sequential computation: the problem of cost-effective resource allocation. Zbl 0458.68005
Megiddo, Nimrod
1
1981
On repeated games with incomplete information played by non-Bayesian players. Zbl 0441.90118
Megiddo, N.
9
1980
Path independent choices. Zbl 0431.90008
Kalai, Ehud; Megiddo, Nimrod
3
1980
Combinatorial optimization with rational objective functions. Zbl 0425.90076
Megiddo, Nimrod
137
1979
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod
13
1979
On Fulkerson’s conjecture about consistent labeling processes. Zbl 0443.90107
Megiddo, Nimrod; Galil, Zvi
1
1979
Computational complexity of the game theory approach to cost allocation for a tree. Zbl 0397.90111
Megiddo, Nimrod
59
1978
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
20
1978
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
13
1978
On the parametric nonlinear complementarity problem. Zbl 0379.90094
Megiddo, Nimrod
8
1978
Combinatorial optimization with rational objective functions. Zbl 1282.68141
Megiddo, Nimrod
4
1978
An \(O(N\cdot \log N)\) algorithm for a class of matching problems. Zbl 0375.68021
Megiddo, Nimrod; Tamir, Arie
1
1978
On the existence and uniqueness of solutions in nonlinear complementarity theory. Zbl 0363.90102
Megiddo, Nimrod; Kojima, Masakazu
18
1977
A good algorithm for lexicographically optimal flows in multiterminal networks. Zbl 0354.90083
Megiddo, Nimrod
13
1977
A monotone complementarity problem with feasible solutions but no complementary solutions. Zbl 0353.90084
Megiddo, Nimrod
11
1977
Mixtures of order matrices and generalized order matrices. Zbl 0377.05008
Megiddo, Nimrod
6
1977
On monotonicity in parametric linear complementarity problems. Zbl 0367.90106
Megiddo, Nimrod
4
1977
Partial and complete cyclic orders. Zbl 0361.06001
Megiddo, Nimrod
14
1976
Tensor decomposition of cooperative games. Zbl 0364.90127
Megiddo, Nimrod
1
1975
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
43
1974
Nucleoluses of compound simple games. Zbl 0254.90065
Megiddo, Nimrod
3
1974
...and 1 more Documents
all top 5

Cited by 2,890 Authors

37 Tamir, Arie
32 Megiddo, Nimrod
25 Kheirfam, Behrouz
25 Ye, Yinyu
19 Wang, Haitao
18 Bhattacharya, Binay Kumar
18 Drezner, Zvi
17 Das, Sandip
17 Puerto Albandoz, Justo
17 Terlaky, Tamás
16 Ognjanović, Zoran
16 Roos, Cornelis
16 Salhi, Said
16 Yang, Boting
15 Potra, Florian-Alexandru
15 Sharir, Micha
14 Darvay, Zsolt
14 Todd, Michael J.
13 Ahn, Hee-Kap
13 Katoh, Naoki
13 Mansouri, Hossein
12 Brimberg, Jack
12 Mizuno, Shinji
12 Monteiro, Renato D. C.
12 Nisse, Nicolas
11 Adler, Ilan
11 Agarwal, Pankaj Kumar
11 Chen, Danny Ziyi
11 Halpern, Joseph Yehuda
11 Kojima, Masakazu
11 Zangiabadi, Maryam
10 Burkard, Rainer E.
10 Díaz-Báñez, Jose Miguel
10 Hassin, Refael
10 Levin, Asaf
10 Matoušek, Jiří
10 Nandy, Subhas Chandra
10 Peyghami, Mohammad Reza
10 Schöbel, Anita
9 Asadi, Soodabeh
9 Fomin, Fedor V.
9 Hochbaum, Dorit S.
9 Huang, Zheng-Hai
9 Hurtado, Ferran
9 Liu, Hongwei
9 Lukasiewicz, Thomas
9 Roy, Sasanka
9 Tokuyama, Takeshi
9 Zangiabadi, Mostafa
8 Bose, Prosenjit K.
8 Cheong, Otfried
8 Dereniowski, Dariusz
8 Dumitrescu, Adrian
8 Gondzio, Jacek
8 Illés, Tibor
8 Júdice, Joaquim João
8 Kabadi, Santosh Narayan
8 Kameda, Tsunehiko
8 Mladenović, Nenad
8 Rašković, Miodrag D.
8 Seara, Carlos
8 Tsuchiya, Takashi
8 Zhang, Shuzhong
8 Zhu, Binhai
7 Arbel, Ami
7 Bereg, Sergey N.
7 Berman, Oded
7 Chan, Timothy Moon-Yew
7 Cho, Gyeong-Mi
7 Deng, Xiao-Tie
7 Edelsbrunner, Herbert
7 Katz, Matthew J.
7 Kedem, Klara
7 Ko, Ming-Tat
7 Mesa, Juan-Antonio
7 Papadimitriou, Christos Harilaos
7 Perović, Aleksandar
7 Thilikos, Dimitrios M.
7 Tseng, Paul
7 Xu, Yinfeng
7 Zhao, Yunbin
6 Arkin, Esther M.
6 Coudert, David
6 Daescu, Ovidiu
6 Fang, Shu-Cherng
6 Granot, Daniel
6 Ikodinović, Nebojša
6 Ishii, Hiroaki
6 Kern, Walter
6 Knauer, Christian
6 Koller, Daphne
6 Krumke, Sven Oliver
6 Langerman, Stefan
6 Mansouri, Hosseino
6 Mitchell, Joseph S. B.
6 Morin, Pat
6 Oh, Eunjin
6 Sturm, Jos F.
6 Subrahmanian, V. S.
6 Sun, Jie
...and 2,790 more Authors
all top 5

Cited in 246 Serials

130 Mathematical Programming. Series A. Series B
121 Theoretical Computer Science
110 European Journal of Operational Research
108 Discrete Applied Mathematics
72 Algorithmica
71 Operations Research Letters
71 Computational Geometry
69 Information Processing Letters
55 Journal of Optimization Theory and Applications
55 Annals of Operations Research
49 Computers & Operations Research
48 Discrete & Computational Geometry
44 International Journal of Computational Geometry & Applications
33 Optimization
30 Games and Economic Behavior
28 Computational Optimization and Applications
25 Artificial Intelligence
25 Journal of Computer and System Sciences
25 Journal of Global Optimization
24 Linear Algebra and its Applications
24 Optimization Methods & Software
23 Journal of Combinatorial Optimization
21 International Journal of Approximate Reasoning
20 Mathematical Programming
19 International Journal of Game Theory
18 Applied Mathematics and Computation
18 Journal of Computational and Applied Mathematics
18 Theory of Computing Systems
15 Discrete Mathematics
15 Networks
15 Top
14 Discrete Optimization
13 Information and Computation
13 Annals of Mathematics and Artificial Intelligence
12 Numerical Algorithms
12 Optimization Letters
10 International Journal of Foundations of Computer Science
9 SIAM Journal on Computing
9 Journal of Complexity
9 Distributed Computing
8 Journal of Economic Theory
8 SIAM Journal on Algebraic and Discrete Methods
8 Mathematical Methods of Operations Research
8 Journal of Discrete Algorithms
7 Computers & Mathematics with Applications
7 Mathematics of Operations Research
7 Mathematical Social Sciences
7 Economic Theory
7 Journal of Scheduling
7 International Game Theory Review
7 Journal of Applied Mathematics and Computing
6 Information Sciences
6 Applied Numerical Mathematics
6 Journal of Mathematical Imaging and Vision
6 RAIRO. Operations Research
6 Mathematical Programming Computation
6 Journal of the Operations Research Society of China
5 Automatica
5 Fuzzy Sets and Systems
5 Operations Research
5 Annals of Pure and Applied Logic
5 Graphs and Combinatorics
5 Science in China. Series A
5 Japan Journal of Industrial and Applied Mathematics
5 International Journal of Computer Mathematics
5 ZOR. Zeitschrift für Operations Research
4 Czechoslovak Mathematical Journal
4 Kybernetika
4 Numerical Functional Analysis and Optimization
4 Acta Mathematicae Applicatae Sinica. English Series
4 Mathematical and Computer Modelling
4 Acta Mathematica Sinica. English Series
4 CEJOR. Central European Journal of Operations Research
4 Journal of Applied Logic
4 Proceedings of the Steklov Institute of Mathematics
4 Asian-European Journal of Mathematics
4 Games
4 Journal of Mathematical Modelling and Algorithms in Operations Research
3 Linear and Multilinear Algebra
3 BIT
3 Computing
3 Journal of Combinatorial Theory. Series B
3 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods
3 Opsearch
3 Studia Logica
3 Social Choice and Welfare
3 Journal of Symbolic Computation
3 Asia-Pacific Journal of Operational Research
3 SIAM Journal on Discrete Mathematics
3 Journal of Parallel and Distributed Computing
3 Random Structures & Algorithms
3 Neural Computation
3 Economics Letters
3 YUJOR. Yugoslav Journal of Operations Research
3 Pattern Recognition
3 Zeitschrift für Operations Research. Serie A: Theorie
3 Bulletin of the American Mathematical Society. New Series
3 Archive for Mathematical Logic
3 SIAM Journal on Optimization
3 Journal of Logic, Language and Information
...and 146 more Serials
all top 5

Cited in 46 Fields

1,176 Operations research, mathematical programming (90-XX)
796 Computer science (68-XX)
266 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
215 Combinatorics (05-XX)
208 Numerical analysis (65-XX)
114 Convex and discrete geometry (52-XX)
95 Mathematical logic and foundations (03-XX)
42 Statistics (62-XX)
39 Calculus of variations and optimal control; optimization (49-XX)
24 Linear and multilinear algebra; matrix theory (15-XX)
19 Information and communication theory, circuits (94-XX)
18 Probability theory and stochastic processes (60-XX)
16 Order, lattices, ordered algebraic structures (06-XX)
13 Systems theory; control (93-XX)
12 Geometry (51-XX)
10 Biology and other natural sciences (92-XX)
8 Quantum theory (81-XX)
7 Group theory and generalizations (20-XX)
7 Mechanics of particles and systems (70-XX)
6 General and overarching topics; collections (00-XX)
5 History and biography (01-XX)
5 Number theory (11-XX)
5 Algebraic geometry (14-XX)
5 Dynamical systems and ergodic theory (37-XX)
5 Mechanics of deformable solids (74-XX)
4 Operator theory (47-XX)
3 Manifolds and cell complexes (57-XX)
2 General algebraic systems (08-XX)
2 Field theory and polynomials (12-XX)
2 Nonassociative rings and algebras (17-XX)
2 Approximations and expansions (41-XX)
2 Functional analysis (46-XX)
2 Algebraic topology (55-XX)
2 Global analysis, analysis on manifolds (58-XX)
1 Commutative algebra (13-XX)
1 Associative rings and algebras (16-XX)
1 Category theory; homological algebra (18-XX)
1 Real functions (26-XX)
1 Special functions (33-XX)
1 Ordinary differential equations (34-XX)
1 Partial differential equations (35-XX)
1 Difference and functional equations (39-XX)
1 Harmonic analysis on Euclidean spaces (42-XX)
1 Integral equations (45-XX)
1 Differential geometry (53-XX)
1 General topology (54-XX)

Citations by Year