×
Compute Distance To:
Author ID: megiddo.nimrod Recent zbMATH articles by "Megiddo, Nimrod"
Published as: Megiddo, Nimrod; Megiddo, N.

Publications by Year

Citations contained in zbMATH Open

102 Publications have been cited 2,620 times in 2,110 Documents Cited by Year
Linear-time algorithms for linear programming in \(R^ 3\) and related problems. Zbl 0521.68034
Megiddo, Nimrod
222
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
171
1991
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
164
1983
On the complexity of some common geometric location problems. Zbl 0534.68032
Megiddo, Nimrod; Supowit, Kenneth J.
147
1984
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
140
1984
Combinatorial optimization with rational objective functions. Zbl 0425.90076
Megiddo, Nimrod
132
1979
A logic for reasoning about probabilities. Zbl 0811.03014
Fagin, Ronald; Halpern, Joseph Y.; Megiddo, Nimrod
126
1990
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
105
1988
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
102
1993
Computational complexity of the game theory approach to cost allocation for a tree. Zbl 0397.90111
Megiddo, Nimrod
61
1978
Pathways to the optimal set in linear programming. Zbl 0687.90056
Megiddo, Nimrod
56
1989
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
47
1989
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
46
1991
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
46
1974
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
45
1983
On total functions, existence theorems and computational complexity. Zbl 0731.68036
Megiddo, Nimrod; Papadimitriou, Christos H.
44
1991
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
43
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
An interior point potential reduction algorithm for the linear complementarity problem. Zbl 0764.90083
Kojima, Masakazu; Megiddo, Nimrod; Ye, Yinyu
36
1992
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
36
1982
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
35
1993
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
33
1988
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
32
1991
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
30
1983
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
30
1991
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
26
1985
Towards a genuinely polynomial algorithm for linear programming. Zbl 0532.90061
Megiddo, Nimrod
25
1983
Efficient computation of equilibria for extensive two-person games. Zbl 0859.90127
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
23
1996
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
22
1992
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
22
1989
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
22
1978
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
21
1991
Computing circular separability. Zbl 0598.52008
O’Rourke, Joseph; Kosaraju, S. Rao; Megiddo, Nimrod
21
1986
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
20
1993
On the existence and uniqueness of solutions in nonlinear complementarity theory. Zbl 0363.90102
Megiddo, Nimrod; Kojima, Masakazu
19
1977
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
18
1989
On finding a minimum dominating set in a tournament. Zbl 0661.68064
Megiddo, Nimrod; Vishkin, Uzi
16
1988
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
15
1978
Partial and complete cyclic orders. Zbl 0361.06001
Megiddo, Nimrod
14
1976
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
14
1985
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
13
2001
On the complexity of some geometric problems in unbounded dimension. Zbl 0717.68046
Megiddo, Nimrod
13
1990
A good algorithm for lexicographically optimal flows in multiterminal networks. Zbl 0354.90083
Megiddo, Nimrod
13
1977
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod
13
1979
Finding least-distance lines. Zbl 0517.05007
Megiddo, Nimrod; Tamir, Arie
13
1983
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
12
1994
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
12
1993
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
12
1994
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
11
1993
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
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
Using fast matrix multiplication to find basic solutions. Zbl 0913.68079
Beling, Peter A.; Megiddo, Nimrod
10
1998
On repeated games with incomplete information played by non-Bayesian players. Zbl 0441.90118
Megiddo, N.
9
1980
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
9
1986
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
9
1989
On the \(\epsilon\)-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
9
1989
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Zbl 0782.68053
Cohen, Edith; Megiddo, Nimrod
8
1993
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
8
1986
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
8
1985
On the parametric nonlinear complementarity problem. Zbl 0379.90094
Megiddo, Nimrod
8
1978
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 geometric separability of Boolean functions. Zbl 0854.68034
Hegedüs, Tibor; Megiddo, Nimrod
7
1996
Recognizing properties of periodic graphs. Zbl 0753.05047
Cohen, Edith; Megiddo, Nimrod
6
1991
An 0(n log n) randomizing algorithm for the weighted Euclidean 1-center problem. Zbl 0612.90033
Megiddo, Nimrod; Zemel, Eitan
6
1986
Mixtures of order matrices and generalized order matrices. Zbl 0377.05008
Megiddo, Nimrod
6
1977
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
6
1984
A note on the generality of the self-dual algorithm with various starting points. Zbl 0561.90063
Megiddo, Nimrod
6
1985
A modified layered-step interior-point algorithm for linear programming. Zbl 0920.90098
Megiddo, Nimrod; Mizuno, Shinji; Tsuchiya, Takashi
5
1998
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
5
1994
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
5
1994
Combinatorial optimization with rational objective functions. Zbl 1282.68141
Megiddo, Nimrod
5
1978
Exact computation of optimal inventory policies over an unbounded horizon. Zbl 0744.90021
Hassin, Refael; Megiddo, Nimrod
4
1991
Finding mixed strategies with small supports in extensive form games. Zbl 0856.90143
Koller, Daphne; Megiddo, Nimrod
4
1996
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
4
1986
Constructing small sample spaces satisfying given constraints. Zbl 1310.68153
Koller, Daphne; Megiddo, Nimrod
4
1993
On monotonicity in parametric linear complementarity problems. Zbl 0367.90106
Megiddo, Nimrod
4
1977
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
A general NP-completeness theorem. Zbl 0815.68055
Megiddo, Nimrod
3
1993
Path independent choices. Zbl 0431.90008
Kalai, Ehud; Megiddo, Nimrod
3
1980
Nucleoluses of compound simple games. Zbl 0254.90065
Megiddo, Nimrod
3
1974
An optimal algorithm for finding all the jumps of a monotone step- function. Zbl 0593.68037
Hassin, Refael; Megiddo, Nimrod
3
1985
A note on approximate linear programming. Zbl 0762.90051
Megiddo, Nimrod
2
1992
A linear programming instance with many crossover events. Zbl 0869.90049
Mizuno, Shinji; Megiddo, Nimrod; Tsuchiya, Takashi
2
1996
A sublinear parallel algorithm for stable matching. Zbl 0961.90088
Feder, Tomás; Megiddo, Nimrod; Plotkin, Serge A.
2
2000
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
2
1982
The kernel and the nucleolus of a product of simple games. Zbl 0208.23006
Megiddo, N.
2
1971
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
Tensor decomposition of cooperative games. Zbl 0364.90127
Megiddo, Nimrod
2
1975
A deterministic poly\((\log\log n)\)-time \(n\)-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
1
1996
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1
1997
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1
1994
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1
1994
On Fulkerson’s conjecture about consistent labeling processes. Zbl 0443.90107
Megiddo, Nimrod; Galil, Zvi
1
1979
An application of parallel computation to sequential computation: the problem of cost-effective resource allocation. Zbl 0458.68005
Megiddo, Nimrod
1
1981
Strategic classification. Zbl 1334.68184
Hardt, Moritz; Megiddo, Nimrod; Papadimitriou, Christos; Wootters, Mary
1
2016
Equilibrium in prediction markets with buyers and sellers. Zbl 1202.91112
Agrawal, Shipra; Megiddo, Nimrod; Armbruster, Benjamin
1
2010
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
Strategic classification. Zbl 1334.68184
Hardt, Moritz; Megiddo, Nimrod; Papadimitriou, Christos; Wootters, Mary
1
2016
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
13
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
10
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
23
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
1
1996
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
12
1994
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
12
1994
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
5
1994
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
5
1994
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1
1994
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1
1994
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
102
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
35
1993
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
20
1993
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
12
1993
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
11
1993
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
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
36
1992
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
22
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
171
1991
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
46
1991
On total functions, existence theorems and computational complexity. Zbl 0731.68036
Megiddo, Nimrod; Papadimitriou, Christos H.
44
1991
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
32
1991
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
30
1991
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
21
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
126
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
56
1989
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
47
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
22
1989
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
18
1989
On the complexity of linear programming. Zbl 0735.90044
Megiddo, Nimrod
10
1989
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
9
1989
On the \(\epsilon\)-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
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.
105
1988
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
33
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
21
1986
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
9
1986
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
8
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
6
1986
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
4
1986
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
26
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
14
1985
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
8
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.
147
1984
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
140
1984
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
6
1984
Linear-time algorithms for linear programming in \(R^ 3\) and related problems. Zbl 0521.68034
Megiddo, Nimrod
222
1983
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
164
1983
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
45
1983
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
43
1983
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
30
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
13
1983
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
36
1982
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
2
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
132
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
61
1978
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
22
1978
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
15
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
5
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
19
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
2
1975
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
46
1974
...and 2 more Documents
all top 5

Cited by 2,858 Authors

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

Cited in 253 Serials

132 Mathematical Programming. Series A. Series B
126 Theoretical Computer Science
111 Discrete Applied Mathematics
103 European Journal of Operational Research
76 Algorithmica
72 Computational Geometry
70 Information Processing Letters
67 Operations Research Letters
56 Annals of Operations Research
55 Journal of Optimization Theory and Applications
49 Discrete & Computational Geometry
45 Computers & Operations Research
44 International Journal of Computational Geometry & Applications
31 Games and Economic Behavior
30 Optimization
30 Computational Optimization and Applications
27 Artificial Intelligence
26 Journal of Global Optimization
24 International Journal of Approximate Reasoning
24 Optimization Methods & Software
23 Journal of Computer and System Sciences
23 Journal of Combinatorial Optimization
22 Linear Algebra and its Applications
20 Mathematical Programming
19 International Journal of Game Theory
19 Theory of Computing Systems
16 Discrete Mathematics
16 Applied Mathematics and Computation
15 Networks
15 Top
14 Annals of Mathematics and Artificial Intelligence
14 Discrete Optimization
12 Information and Computation
12 Numerical Algorithms
12 Optimization Letters
10 SIAM Journal on Computing
10 International Journal of Foundations of Computer Science
9 Mathematics of Operations Research
9 Distributed Computing
8 Journal of Economic Theory
8 SIAM Journal on Algebraic and Discrete Methods
8 Journal of Complexity
8 Mathematical Methods of Operations Research
8 Journal of Scheduling
8 Journal of Applied Mathematics and Computing
8 Journal of Discrete Algorithms
7 Journal of Computational and Applied Mathematics
7 Mathematical Social Sciences
7 Economic Theory
7 International Game Theory Review
7 Journal of the Operations Research Society of China
6 Information Sciences
6 International Journal of Computer Mathematics
6 Journal of Mathematical Imaging and Vision
6 RAIRO. Operations Research
6 Journal of Industrial and Management Optimization
6 Mathematical Programming Computation
5 Computers & Mathematics with Applications
5 Fuzzy Sets and Systems
5 Operations Research
5 Annals of Pure and Applied Logic
5 Applied Numerical Mathematics
5 Graphs and Combinatorics
5 Science in China. Series A
5 Japan Journal of Industrial and Applied Mathematics
5 ZOR. Zeitschrift für Operations Research
5 CEJOR. Central European Journal of Operations Research
5 Games
4 Czechoslovak Mathematical Journal
4 Kybernetika
4 Numerical Functional Analysis and Optimization
4 Acta Mathematicae Applicatae Sinica. English Series
4 SIAM Journal on Discrete Mathematics
4 Bulletin of the American Mathematical Society. New Series
4 INFORMS Journal on Computing
4 Acta Mathematica Sinica. English Series
4 4OR
4 Journal of Applied Logic
4 Proceedings of the Steklov Institute of Mathematics
4 Asian-European Journal of Mathematics
4 Journal of Mathematical Modelling and Algorithms in Operations Research
3 Acta Informatica
3 Linear and Multilinear Algebra
3 Automatica
3 BIT
3 Computing
3 Journal of Combinatorial Theory. Series B
3 Opsearch
3 Studia Logica
3 Social Choice and Welfare
3 Journal of Symbolic Computation
3 Asia-Pacific Journal of Operational Research
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 Archive for Mathematical Logic
...and 153 more Serials
all top 5

Cited in 46 Fields

1,167 Operations research, mathematical programming (90-XX)
838 Computer science (68-XX)
275 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
225 Combinatorics (05-XX)
196 Numerical analysis (65-XX)
120 Convex and discrete geometry (52-XX)
108 Mathematical logic and foundations (03-XX)
46 Statistics (62-XX)
39 Calculus of variations and optimal control; optimization (49-XX)
22 Linear and multilinear algebra; matrix theory (15-XX)
20 Information and communication theory, circuits (94-XX)
19 Probability theory and stochastic processes (60-XX)
17 Order, lattices, ordered algebraic structures (06-XX)
14 Geometry (51-XX)
11 Systems theory; control (93-XX)
10 Biology and other natural sciences (92-XX)
9 Quantum theory (81-XX)
8 General and overarching topics; collections (00-XX)
7 Group theory and generalizations (20-XX)
7 Mechanics of particles and systems (70-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 General algebraic systems (08-XX)
4 Operator theory (47-XX)
4 Manifolds and cell complexes (57-XX)
3 Approximations and expansions (41-XX)
3 Functional analysis (46-XX)
3 Algebraic topology (55-XX)
2 Field theory and polynomials (12-XX)
2 Nonassociative rings and algebras (17-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 Measure and integration (28-XX)
1 Special functions (33-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)
1 Global analysis, analysis on manifolds (58-XX)

Citations by Year