×

zbMATH — the first resource for mathematics

Berman, Piotr

Compute Distance To:
Author ID: berman.piotr Recent zbMATH articles by "Berman, Piotr"
Published as: Berman, P.; Berman, Piotr
Documents Indexed: 88 Publications since 1977, including 1 Book

Publications by Year

Citations contained in zbMATH

70 Publications have been cited 555 times in 510 Documents Cited by Year
A 2-approximation algorithm for the undirected feedback vertex set problem. Zbl 0932.68054
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro
76
1999
On-line load balancing for related machines. Zbl 0954.68050
Berman, Piotr; Charikar, Moses; Karpinski, Marek
30
2000
On the complexity of approximating the independent set problem. Zbl 0804.90121
Berman, Piotr; Schnitger, Georg
28
1992
Improved approximations for the Steiner tree problem. Zbl 0820.68049
Berman, Piotr; Ramaiyer, Viswanathan
27
1994
\(8/7\)-approximation algorithm for \((1,2)\)-TSP. Zbl 1192.90158
Berman, Piotr; Karpinski, Marek
24
2006
On-line algorithms for Steiner tree problems. (Extended abstract). Zbl 0963.68152
Berman, Piotr; Coulston, Chris
24
1999
1. 375-approximation algorithm for sorting by reversals. Zbl 1019.68817
Berman, Piotr; Hannenhalli, Sridhar; Karpinski, Marek
19
2002
On complexity of regular languages in terms of finite automata. Zbl 0364.68057
Berman, Piotr; Lingas, Andrzej
19
1977
On approximation properties of the independent set problem for low degree graphs. Zbl 0916.68109
Berman, P.; Fujito, T.
18
1999
Efficient approximation algorithms for tiling and packing problems with rectangles. Zbl 0999.68248
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta
16
2001
Approximating maximum independent set in bounded degree graphs. Zbl 0873.68163
Berman, Piotr; Fürer, Martin
15
1994
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0972.68127
Berman, Piotr
12
2000
Tight approximability results for test set problems in bioinformatics. Zbl 1076.68113
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang
11
2005
Relationship between density and deterministic complexity of NP-complete languages. Zbl 0382.68068
Berman, Piotr
11
1978
Online navigation in a room. Zbl 1321.68430
Bar-Eli, Eldad; Berman, Piotr; Fiat, Amos; Yan, Peiyuan
10
1994
Algorithms for the least distance problem. Zbl 0968.90501
Berman, Piotr; Kovoor, Nainan; Pardalos, Panos M.
10
1993
A competitive 3-server algorithm. Zbl 0800.68452
Berman, P.; Karloff, H.; Tardos, G.
10
1990
On the complexity of pattern matching for highly compressed two-dimensional texts. Zbl 1059.68098
Berman, Piotr; Karpinski, Marek; Larmore, Lawrence L.; Plandowski, Wojciech; Rytter, Wojciech
9
2002
Cloture votes: \(n/4\)-resilient distributed consensus in \(t+1\) rounds. Zbl 0766.68004
Berman, Piotr; Garay, Juan A.
9
1993
\(L_p\)-testing. Zbl 1315.68278
Berman, Piotr; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
8
2014
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1163.68045
Berman, Piotr; Dasgupta, Bhaskar; Sontag, Eduardo
8
2007
Improved approximations for the Steiner tree problem. Zbl 0829.68063
Berman, Piotr; Ramaiyer, Viswanathan
8
1992
Multi-phase algorithms for throughput maximization for real-time scheduling. Zbl 0991.90061
Berman, Piotr; Dasgupta, Bhaskar
7
2000
Reliable broadcasting in logarithmic time with Byzantine link failures. Zbl 0866.68011
Berman, Piotr; Diks, Krzryztof; Pelc, Andrzej
7
1997
Randomized robot navigation algorithms. Zbl 0960.68593
Berman, Piotr; Blum, Avrim; Fiat, Amos; Karloff, Howard; Rosén, Adi; Saks, Michael
7
1996
Approximation algorithms for spanner problems and directed Steiner forest. Zbl 1267.68317
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
6
2013
\(O(1)\)-approximations for maximum movement problems. Zbl 1343.68306
Berman, Piotr; Demaine, Erik D.; Zadimoghaddam, Morteza
6
2011
Faster approximation of distances in graphs. Zbl 1209.05238
Berman, Piotr; Kasiviswanathan, Shiva Prasad
6
2007
Computational complexity of some restricted instances of 3-SAT. Zbl 1111.68044
Berman, Piotr; Karpinski, Marek; Scott, Alexander D.
6
2007
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0966.68609
Berman, Piotr
6
2000
Speed is more powerful than clairvoyance. Zbl 0946.68157
Berman, Piotr; Coulston, Chris
6
1999
A note on sweeping automata. Zbl 0479.68081
Berman, Piotr
6
1980
Improved approximation for the directed spanner problem. Zbl 1332.68283
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
5
2011
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION. Zbl 1057.68646
Berman, Piotr; Karpinski, Marek
5
2002
Improvements in throughout maximization for real-time scheduling. Zbl 1296.90040
Berman, Piotr; DasGupta, Bhaskar
5
2000
On the power of nondeterminism in dynamic logic. Zbl 0494.68032
Berman, Piotr; Halpern, Joseph Y.; Tiuryn, Jerzy
5
1982
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1106.68432
Berman, Piotr; DasGupta, Bhaskar; Sontag, Eduardo
4
2004
Fast consensus in networks of bounded degree. Zbl 1282.68092
Berman, Piotr; Garay, Juan A.
4
1993
The power and limitations of uniform samples in testing properties of figures. Zbl 1391.68106
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
3
2016
Testing convexity of figures under the uniform distribution. Zbl 1387.68239
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
3
2016
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2. Zbl 1253.68355
Berman, Piotr; Karpinski, Marek; Zelikovsky, Alexander
3
2009
On constructing an optimal consensus clustering from multiple clusterings. Zbl 1184.68630
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang; Wang, Jie
3
2007
Optimizing misdirection. Zbl 1094.68604
Berman, Piotr; Krysta, Piotr
3
2003
Approximation algorithms for MAX-MIN tiling. Zbl 1045.68149
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2003
Simple approximation algorithm for nonoverlapping local alignments. Zbl 1092.68733
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2002
Exact size of binary space partitionings and improved rectangle tiling algorithms. Zbl 1050.68145
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2002
Improved approximation algorithms for rectangle tiling and packing. Zbl 1113.68635
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta
3
2001
Complexities of efficient solutions of rectilinear polygon cover problems. Zbl 0869.68058
Berman, P.; DasGupta, B.
3
1997
Tolerant testers of image properties. Zbl 1388.68281
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
2
2016
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1333.68203
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory
2
2011
Finding sparser directed spanners. Zbl 1245.68246
Berman, Piotr; Raskhodnikova, Sofya; Ruan, Ge
2
2010
Approximating transitive reductions for directed networks. Zbl 1253.68354
Berman, Piotr; DasGupta, Bhaskar; Karpinski, Marek
2
2009
On approximating four covering and packing problems. Zbl 1169.90017
Ashley, Mary; Berger-Wolf, Tanya; Berman, Piotr; Chaovalitwongse, Wanpracha; Dasgupta, Bhaskar; Kao, Ming-Yang
2
2009
Approximating the online set multicover problems via randomized winnowing. Zbl 1137.68061
Berman, Piotr; DasGupta, Bhaskar
2
2008
Optimal trade-off for Merkle tree traversal. Zbl 1108.68047
Berman, Piotr; Karpinski, Marek; Nekrich, Yakov
2
2007
On the vehicle routing problem. Zbl 1161.68873
Berman, Piotr; Das, Surajit K.
2
2005
Approximating minimum unsatisfiability of linear equations. Zbl 1254.68348
Berman, Piotr; Karpinski, Marek
2
2002
On approximation of the power-\(p\) and bottleneck Steiner trees. Zbl 0945.90046
Berman, Piotr; Zelikovsky, Alexander
2
2000
On the computational complexity of measuring global stability of banking networks. Zbl 1307.91197
Berman, Piotr; DasGupta, Bhaskar; Kaligounder, Lakshmi; Karpinski, Marek
1
2014
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1363.05094
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory
1
2014
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2012
Primal-dual approximation algorithms for node-weighted network design in planar graphs. Zbl 1358.68318
Berman, Piotr; Yaroslavtsev, Grigory
1
2012
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2010
Applications of the linear matroid parity algorithm to approximating Steiner trees. Zbl 1185.68460
Berman, Piotr; Fürer, Martin; Zelikovsky, Alexander
1
2006
Aligning two fragmented sequences. Zbl 1014.92012
Veeramachaneni, Vamsi; Berman, Piotr; Miller, Webb
1
2003
Slice and dice: a simple, improved approximate tiling recipe. Zbl 1093.68606
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
1
2002
A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Zbl 1026.92022
Berman, Piotr; DasGupta, Bhaskar
1
2002
The \(T\)-join problem in sparse graphs: applications to phase assingment problem in VLSI mask layout. Zbl 1063.68612
Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra; Zelikovsky, Alexander
1
1999
On the performance of the minimum degree ordering for Gaussian elimination. Zbl 0703.65016
Berman, Piotr; Schnitger, Georg
1
1990
Complexity of the theory of atomless Boolean algebras. Zbl 0421.03028
Berman, Piotr
1
1979
The power and limitations of uniform samples in testing properties of figures. Zbl 1391.68106
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
3
2016
Testing convexity of figures under the uniform distribution. Zbl 1387.68239
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
3
2016
Tolerant testers of image properties. Zbl 1388.68281
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya
2
2016
\(L_p\)-testing. Zbl 1315.68278
Berman, Piotr; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
8
2014
On the computational complexity of measuring global stability of banking networks. Zbl 1307.91197
Berman, Piotr; DasGupta, Bhaskar; Kaligounder, Lakshmi; Karpinski, Marek
1
2014
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1363.05094
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory
1
2014
Approximation algorithms for spanner problems and directed Steiner forest. Zbl 1267.68317
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
6
2013
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2012
Primal-dual approximation algorithms for node-weighted network design in planar graphs. Zbl 1358.68318
Berman, Piotr; Yaroslavtsev, Grigory
1
2012
\(O(1)\)-approximations for maximum movement problems. Zbl 1343.68306
Berman, Piotr; Demaine, Erik D.; Zadimoghaddam, Morteza
6
2011
Improved approximation for the directed spanner problem. Zbl 1332.68283
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory
5
2011
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1333.68203
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory
2
2011
Finding sparser directed spanners. Zbl 1245.68246
Berman, Piotr; Raskhodnikova, Sofya; Ruan, Ge
2
2010
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej
1
2010
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2. Zbl 1253.68355
Berman, Piotr; Karpinski, Marek; Zelikovsky, Alexander
3
2009
Approximating transitive reductions for directed networks. Zbl 1253.68354
Berman, Piotr; DasGupta, Bhaskar; Karpinski, Marek
2
2009
On approximating four covering and packing problems. Zbl 1169.90017
Ashley, Mary; Berger-Wolf, Tanya; Berman, Piotr; Chaovalitwongse, Wanpracha; Dasgupta, Bhaskar; Kao, Ming-Yang
2
2009
Approximating the online set multicover problems via randomized winnowing. Zbl 1137.68061
Berman, Piotr; DasGupta, Bhaskar
2
2008
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1163.68045
Berman, Piotr; Dasgupta, Bhaskar; Sontag, Eduardo
8
2007
Faster approximation of distances in graphs. Zbl 1209.05238
Berman, Piotr; Kasiviswanathan, Shiva Prasad
6
2007
Computational complexity of some restricted instances of 3-SAT. Zbl 1111.68044
Berman, Piotr; Karpinski, Marek; Scott, Alexander D.
6
2007
On constructing an optimal consensus clustering from multiple clusterings. Zbl 1184.68630
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang; Wang, Jie
3
2007
Optimal trade-off for Merkle tree traversal. Zbl 1108.68047
Berman, Piotr; Karpinski, Marek; Nekrich, Yakov
2
2007
\(8/7\)-approximation algorithm for \((1,2)\)-TSP. Zbl 1192.90158
Berman, Piotr; Karpinski, Marek
24
2006
Applications of the linear matroid parity algorithm to approximating Steiner trees. Zbl 1185.68460
Berman, Piotr; Fürer, Martin; Zelikovsky, Alexander
1
2006
Tight approximability results for test set problems in bioinformatics. Zbl 1076.68113
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang
11
2005
On the vehicle routing problem. Zbl 1161.68873
Berman, Piotr; Das, Surajit K.
2
2005
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1106.68432
Berman, Piotr; DasGupta, Bhaskar; Sontag, Eduardo
4
2004
Optimizing misdirection. Zbl 1094.68604
Berman, Piotr; Krysta, Piotr
3
2003
Approximation algorithms for MAX-MIN tiling. Zbl 1045.68149
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2003
Aligning two fragmented sequences. Zbl 1014.92012
Veeramachaneni, Vamsi; Berman, Piotr; Miller, Webb
1
2003
1. 375-approximation algorithm for sorting by reversals. Zbl 1019.68817
Berman, Piotr; Hannenhalli, Sridhar; Karpinski, Marek
19
2002
On the complexity of pattern matching for highly compressed two-dimensional texts. Zbl 1059.68098
Berman, Piotr; Karpinski, Marek; Larmore, Lawrence L.; Plandowski, Wojciech; Rytter, Wojciech
9
2002
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION. Zbl 1057.68646
Berman, Piotr; Karpinski, Marek
5
2002
Simple approximation algorithm for nonoverlapping local alignments. Zbl 1092.68733
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2002
Exact size of binary space partitionings and improved rectangle tiling algorithms. Zbl 1050.68145
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
3
2002
Approximating minimum unsatisfiability of linear equations. Zbl 1254.68348
Berman, Piotr; Karpinski, Marek
2
2002
Slice and dice: a simple, improved approximate tiling recipe. Zbl 1093.68606
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.
1
2002
A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Zbl 1026.92022
Berman, Piotr; DasGupta, Bhaskar
1
2002
Efficient approximation algorithms for tiling and packing problems with rectangles. Zbl 0999.68248
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta
16
2001
Improved approximation algorithms for rectangle tiling and packing. Zbl 1113.68635
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta
3
2001
On-line load balancing for related machines. Zbl 0954.68050
Berman, Piotr; Charikar, Moses; Karpinski, Marek
30
2000
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0972.68127
Berman, Piotr
12
2000
Multi-phase algorithms for throughput maximization for real-time scheduling. Zbl 0991.90061
Berman, Piotr; Dasgupta, Bhaskar
7
2000
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0966.68609
Berman, Piotr
6
2000
Improvements in throughout maximization for real-time scheduling. Zbl 1296.90040
Berman, Piotr; DasGupta, Bhaskar
5
2000
On approximation of the power-\(p\) and bottleneck Steiner trees. Zbl 0945.90046
Berman, Piotr; Zelikovsky, Alexander
2
2000
A 2-approximation algorithm for the undirected feedback vertex set problem. Zbl 0932.68054
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro
76
1999
On-line algorithms for Steiner tree problems. (Extended abstract). Zbl 0963.68152
Berman, Piotr; Coulston, Chris
24
1999
On approximation properties of the independent set problem for low degree graphs. Zbl 0916.68109
Berman, P.; Fujito, T.
18
1999
Speed is more powerful than clairvoyance. Zbl 0946.68157
Berman, Piotr; Coulston, Chris
6
1999
The \(T\)-join problem in sparse graphs: applications to phase assingment problem in VLSI mask layout. Zbl 1063.68612
Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra; Zelikovsky, Alexander
1
1999
Reliable broadcasting in logarithmic time with Byzantine link failures. Zbl 0866.68011
Berman, Piotr; Diks, Krzryztof; Pelc, Andrzej
7
1997
Complexities of efficient solutions of rectilinear polygon cover problems. Zbl 0869.68058
Berman, P.; DasGupta, B.
3
1997
Randomized robot navigation algorithms. Zbl 0960.68593
Berman, Piotr; Blum, Avrim; Fiat, Amos; Karloff, Howard; Rosén, Adi; Saks, Michael
7
1996
Improved approximations for the Steiner tree problem. Zbl 0820.68049
Berman, Piotr; Ramaiyer, Viswanathan
27
1994
Approximating maximum independent set in bounded degree graphs. Zbl 0873.68163
Berman, Piotr; Fürer, Martin
15
1994
Online navigation in a room. Zbl 1321.68430
Bar-Eli, Eldad; Berman, Piotr; Fiat, Amos; Yan, Peiyuan
10
1994
Algorithms for the least distance problem. Zbl 0968.90501
Berman, Piotr; Kovoor, Nainan; Pardalos, Panos M.
10
1993
Cloture votes: \(n/4\)-resilient distributed consensus in \(t+1\) rounds. Zbl 0766.68004
Berman, Piotr; Garay, Juan A.
9
1993
Fast consensus in networks of bounded degree. Zbl 1282.68092
Berman, Piotr; Garay, Juan A.
4
1993
On the complexity of approximating the independent set problem. Zbl 0804.90121
Berman, Piotr; Schnitger, Georg
28
1992
Improved approximations for the Steiner tree problem. Zbl 0829.68063
Berman, Piotr; Ramaiyer, Viswanathan
8
1992
A competitive 3-server algorithm. Zbl 0800.68452
Berman, P.; Karloff, H.; Tardos, G.
10
1990
On the performance of the minimum degree ordering for Gaussian elimination. Zbl 0703.65016
Berman, Piotr; Schnitger, Georg
1
1990
On the power of nondeterminism in dynamic logic. Zbl 0494.68032
Berman, Piotr; Halpern, Joseph Y.; Tiuryn, Jerzy
5
1982
A note on sweeping automata. Zbl 0479.68081
Berman, Piotr
6
1980
Complexity of the theory of atomless Boolean algebras. Zbl 0421.03028
Berman, Piotr
1
1979
Relationship between density and deterministic complexity of NP-complete languages. Zbl 0382.68068
Berman, Piotr
11
1978
On complexity of regular languages in terms of finite automata. Zbl 0364.68057
Berman, Piotr; Lingas, Andrzej
19
1977
all top 5

Cited by 942 Authors

11 DasGupta, Bhaskar
10 Rawitz, Dror
9 Berman, Piotr
9 Epstein, Leah
9 Pelc, Andrzej
8 Halldórsson, Magnús Mar
8 Saurabh, Saket
8 Sgall, Jiří
7 Feige, Uriel
7 Raskhodnikova, Sofya
6 Bodlaender, Hans L.
6 Geffert, Viliam
6 Kapoutsis, Christos A.
6 Pighizzini, Giovanni
6 Williamson, David P.
6 Zhu, Daming
5 Bar-Yehuda, Reuven
5 Chan, Timothy Moon-Yew
5 Lin, Guohui
5 Paschos, Vangelis Th.
5 Peleg, David
5 Segev, Danny
5 Tu, Jianhua
4 Abu-Affash, A. Karim
4 Chakaravarthy, Venkatesan T.
4 Chakrabarty, Deeparnab
4 Chandran, L. Sunil
4 Chen, Jian-er
4 Choudhury, Anamitra Roy
4 Demange, Marc
4 Dias, Zanoni
4 Dósa, György
4 Fertin, Guillaume
4 Fomin, Fedor V.
4 Grigorescu, Elena
4 Jansen, Bart M. P.
4 Lokshtanov, Daniel
4 Niedermeier, Rolf
4 Panigrahi, Debmalya
4 Schmied, Richard
4 van Stee, Rob
4 Wu, Weili
4 Zelikovsky, Alexander Z.
4 Zhang, Zhao
3 Agrawal, Akanksha
3 Ashley, Mary V.
3 Banik, Aritra
3 Berger-Wolf, Tanya Y.
3 Böhm, Martin
3 Carmi, Paz
3 Chaovalitwongse, Wanpracha Art
3 Du, Ding-Zhu
3 Ebenlendr, Tomáš
3 Elkin, Michael
3 Fraigniaud, Pierre
3 Francis, Mathew C.
3 Giroudeau, Rodolphe
3 Guo, Jiong
3 Hajiaghayi, Mohammad Taghi
3 Hassin, Refael
3 Hemaspaandra, Lane A.
3 Ilcinkas, David
3 Im, Sungjin
3 Ito, Takehiro
3 Jiang, Haitao
3 Kanj, Iyad A.
3 Kann, Viggo
3 Kao, Ming-Yang
3 Karpinski, Marek
3 Katz, Matthew J.
3 Kawarabayashi, Ken-ichi
3 König, Jean-Claude
3 Královič, Rastislav
3 Královič, Richard
3 Kratsch, Stefan
3 Lam, Tak-Wah
3 Mereghetti, Carlo
3 Miyano, Eiji
3 Mnich, Matthias
3 Mömke, Tobias
3 Nagamochi, Hiroshi
3 Nagarajan, Viswanath
3 Pilipczuk, Marcin
3 Qian, Jiawei
3 Raman, Venkatesh
3 Ravi, Ramamoorthi
3 Reichman, Daniel
3 Sabharwal, Yogish
3 Sau, Ignasi
3 Schmidt-Schauß, Manfred
3 Sivadasan, Naveen
3 Suchý, Ondřej
3 Tan, Zhiyi
3 To, Kar-Keung
3 Tuza, Zsolt
3 Veselý, Pavel
3 Wiese, Andreas
3 Wigderson, Avi
3 Xu, Xirong
3 Zehavi, Meirav
...and 842 more Authors
all top 5

Cited in 83 Serials

85 Theoretical Computer Science
45 Algorithmica
36 Information Processing Letters
32 Discrete Applied Mathematics
26 Journal of Computer and System Sciences
18 Journal of Combinatorial Optimization
14 SIAM Journal on Computing
14 Information and Computation
14 Theory of Computing Systems
11 Mathematical Programming. Series A. Series B
10 Journal of Discrete Algorithms
9 SIAM Journal on Discrete Mathematics
8 Journal of Scheduling
7 European Journal of Operational Research
6 International Journal of Foundations of Computer Science
5 Discrete Mathematics
5 Operations Research Letters
5 Discrete Optimization
4 Computers & Operations Research
4 Computer Science Review
3 Networks
3 Combinatorica
3 Discrete & Computational Geometry
3 Computational Geometry
3 Computational Optimization and Applications
3 RAIRO. Operations Research
2 Mathematical Systems Theory
2 Siberian Mathematical Journal
2 European Journal of Combinatorics
2 Applied Mathematics Letters
2 Annals of Operations Research
2 International Journal of Computational Geometry & Applications
2 Journal of Global Optimization
2 Automation and Remote Control
2 Computational Complexity
2 CEJOR. Central European Journal of Operations Research
2 Optimization Letters
1 Computers & Mathematics with Applications
1 International Journal of Control
1 Journal of Mathematical Biology
1 Acta Mathematica
1 Advances in Mathematics
1 Applied Mathematics and Computation
1 BIT
1 Information Sciences
1 International Journal of Game Theory
1 Journal of Combinatorial Theory. Series B
1 Journal of Optimization Theory and Applications
1 Operations Research
1 Opsearch
1 SIAM Journal on Numerical Analysis
1 Graphs and Combinatorics
1 Journal of Complexity
1 Journal of Computer Science and Technology
1 Asia-Pacific Journal of Operational Research
1 Journal of Cryptology
1 Random Structures & Algorithms
1 Japan Journal of Industrial and Applied Mathematics
1 International Journal of Algebra and Computation
1 MSCS. Mathematical Structures in Computer Science
1 Games and Economic Behavior
1 Historia Mathematica
1 Bulletin of the American Mathematical Society. New Series
1 Distributed Computing
1 RAIRO. Informatique Théorique et Applications
1 Tatra Mountains Mathematical Publications
1 SIAM Journal on Scientific Computing
1 European Journal of Control
1 Optimization Methods & Software
1 Journal of Graph Algorithms and Applications
1 Journal of the ACM
1 RAIRO. Theoretical Informatics and Applications
1 Journal of Systems Science and Complexity
1 Theory and Practice of Logic Programming
1 4OR
1 ACM Journal of Experimental Algorithmics
1 Acta Numerica
1 Discrete Mathematics, Algorithms and Applications
1 Algorithms
1 Advances in Mathematical Physics
1 Science China. Information Sciences
1 RAIRO. Theoretical Informatics and Applications
1 ACM Transactions on Algorithms

Citations by Year