Mordechai Shalom

Cituota

	Visi	Nuo 2019
Šaltiniai	678	235
h-rodyklė	14	8
i10-rodyklė	22	7

200520062007200820092010201120122013201420152016201720182019202020212022202320247 16 33 26 24 40 15 14 29 32 32 53 47 40 41 39 49 39 29 37

Viešas pasiekiamumas

Peržiūrėti viską

9 straipsniai

1 straipsnis

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

zaks shmuelProfessor, Department of Computer Science, Technion, Haifa, IsraelPatvirtintas el. paštas cs.technion.ac.il
Luca MoscardelliAssociate Professor, University of Chieti-Pescara, ItalyPatvirtintas el. paštas unich.it
Gianpiero MonacoAssociate Professor, University of Chieti-Pescara, Italy.Patvirtintas el. paštas unich.it
Prudence W.H. WongDepartment of Computer Science, University of LiverpoolPatvirtintas el. paštas liverpool.ac.uk
Tınaz EkimEndüstri Mühendisliği, Boğaziçi ÜniversitesiPatvirtintas el. paštas boun.edu.tr
Didem GözüpekDepartment of Computer Engineering, Gebze Technical UniversityPatvirtintas el. paštas gtu.edu.tr
Arman BoyacıBogazici UniversityPatvirtintas el. paštas boun.edu.tr
George B. MertziosAssociate Professor, Durham UniversityPatvirtintas el. paštas durham.ac.uk
Ignasi SauCNRS, LIRMM, Université de Montpellier, FrancePatvirtintas el. paštas lirmm.fr
Tami TamirProfessor of Computer Science, The Interdisciplinary Center (IDC)Patvirtintas el. paštas idc.ac.il
Shay KuttenProfessor, TechnionPatvirtintas el. paštas technion.ac.il
Sibel ÖzkanMatematik Profesörü, Gebze Teknik ÜniversitesiPatvirtintas el. paštas gtu.edu.tr
Yuval EmekTechnion - Israel Institute of TechnologyPatvirtintas el. paštas technion.ac.il
Christophe PaulCNRS LIRMMPatvirtintas el. paštas lirmm.fr
Martin MilaničUniversity of Primorska, Koper, SloveniaPatvirtintas el. paštas upr.si
Zakir DenizDepartment of Mathematics, Duzce UniversityPatvirtintas el. paštas duzce.edu.tr
David PelegProfessor of Computer Science, Weizmann InstitutePatvirtintas el. paštas weizmann.ac.il
Fatih AlagozBogazici UniversityPatvirtintas el. paštas boun.edu.tr
Dimitrios M. ThilikosPatvirtintas el. paštas thilikos.info
Cemil DibekKoc UniversityPatvirtintas el. paštas alumni.princeton.edu

Stebėti

Mordechai Shalom

Tel Hai Academic College

Patvirtintas el. paštas telhai.ac.il

Approximation Algorithms On-line Algorithms Graph Algorithms Matching


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Minimizing total busy time in parallel scheduling with application to optical networks M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ... Theoretical Computer Science 411 (40-42), 3553-3562, 2010	81	2010
Optimizing busy time on parallel machines GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks Theoretical Computer Science 562, 524-541, 2015	50	2015
Online optimization of busy time on parallel machines M Shalom, A Voloshin, PWH Wong, FCC Yung, S Zaks Theoretical Computer Science 560, 190-206, 2014	41	2014
A 10/7+/spl epsi/approximation for minimizing the number of ADMs in SONET rings M Shalom, S Zaks First International Conference on Broadband Networks, 254-262, 2004	38	2004
Online coalition structure generation in graph games M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks Proceedings of the 17th International Conference on Autonomous Agents and …, 2018	24	2018
Placing regenerators in optical networks to satisfy multiple sets of requests GB Mertzios, I Sau, M Shalom, S Zaks IEEE/ACM Transactions on Networking 20 (6), 1870-1879, 2012	24	2012
Approximating the traffic grooming problem M Flammini, L Moscardelli, M Shalom, S Zaks Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005	21	2005
Approximating the traffic grooming problem M Flammini, L Moscardelli, M Shalom, S Zaks Journal of Discrete Algorithms 6 (3), 472-479, 2008	16	2008
Approximating the traffic grooming problem with respect to adms and oadms M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks European Conference on Parallel Processing, 920-929, 2008	16	2008
On minimizing the number of adms in a general topology optical network M Flammini, M Shalom, S Zaks International Symposium on Distributed Computing, 459-473, 2006	16	2006
Online regenerator placement GB Mertzios, M Shalom, PWH Wong, S Zaks International Conference On Principles Of Distributed Systems, 4-17, 2011	15*	2011
On the complexity of the traffic grooming problem in optical networks M Shalom, W Unger, S Zaks Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello …, 2007	15	2007
A graph-theoretic approach to scheduling in cognitive radio networks D Gözüpek, M Shalom, F Alagöz IEEE/ACM Transactions on Networking 23 (1), 317-328, 2014	14	2014
Profit maximization in flex-grid all-optical networks M Shalom, PWH Wong, S Zaks Structural Information and Communication Complexity: 20th International …, 2013	14	2013
On the online coalition structure generation problem M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks Journal of Artificial Intelligence Research 72, 1215-1250, 2021	13	2021
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs A Boyacı, T Ekim, M Shalom Information Processing Letters 121, 29-33, 2017	13	2017
The maximum cardinality cut problem in co-bipartite chain graphs A Boyacı, T Ekim, M Shalom Journal of Combinatorial Optimization 35, 250-265, 2018	12	2018
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability D Gözüpek, S Özkan, C Paul, I Sau, M Shalom Theoretical Computer Science 690, 91-103, 2017	10	2017
Optimizing regenerator cost in traffic grooming M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks Theoretical Computer Science 412 (52), 7109-7121, 2011	10	2011
A 10/7 + Approximation for Minimizing the Number of ADMs in SONET Rings M Shalom, S Zaks IEEE/ACM Transactions on Networking 15 (6), 1593-1602, 2007	10	2007

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai