No photo of Guy Even

View Scopus Profile

Guy Even

Professor

Former affiliations
 https://orcid.org/0000-0001-5407-330X
1992 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2024

    An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement

    Bienkowski, M. & Even, G., Mar 2024, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Beyersdorff, O., Kante, M. M., Kupferman, O. & Lokshtanov, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 289).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2023

    Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership

    Even, G., Domingues, G. M. & Toutian, P., 17 Jun 2023, SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 291-294 4 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2022

    An extendable data structure for incremental stable perfect hashing

    Bercea, I. O. & Even, G., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 1298-1310 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2021

    Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations

    Bercea, I. O. & Even, G., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 144-157 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Upper Tail Analysis of Bucket Sort and Random Tries

    Bercea, I. O. & Even, G., 2021, Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. Calamoneri, T. & Corò, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 116-129 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12701 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2020

    A dynamic space-efficient filter with constant time operations

    Bercea, I. O. & Even, G., 1 Jun 2020, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020. Albers, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 162).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations
  • 2019

    Asymptotically Optimal Filters

    Even, G., Jun 2019, The 31st ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: Association for Computing Machinery, p. 47 1 p. (SPAA '19).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Brief Announcement: Optimal Distributed Covering Algorithms

    Ben Basat, R., Even, G., Kawarabayashi, K. I. & Schwartzman, G., 16 Jul 2019, PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 104-106 3 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Scopus citations

  • Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence

    Berestizshevsky, K. & Even, G., 2019, Artificial Neural Networks and Machine Learning – ICANN 2019: Deep Learning - 28th International Conference on Artificial Neural Networks, Proceedings. Tetko, I. V., Karpov, P., Theis, F. & Kurková, V. (eds.). Springer Verlag, p. 306-320 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11728 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    21 Scopus citations

  • Optimal distributed covering algorithms

    Ben-Basat, R., Even, G., Kawarabayashi, K. I. & Schwartzman, G., Oct 2019, 33rd International Symposium on Distributed Computing, DISC 2019. Suomela, J. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 146).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Sign Based Derivative Filtering for Stochastic Gradient Descent

    Berestizshevsky, K. & Even, G., 2019, Artificial Neural Networks and Machine Learning – ICANN 2019: Deep Learning - 28th International Conference on Artificial Neural Networks, Proceedings. Tetko, I. V., Karpov, P., Theis, F. & Kurková, V. (eds.). Springer Verlag, p. 208-219 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11728 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2018

    A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log 2 log Δ) rounds

    Ben-Basat, R., Even, G., Kawarabayashi, K. I. & Schwartzman, G., 2018, 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Lotker, Z. & Patt-Shamir, B. (eds.). Springer Verlag, p. 226-236 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11085).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations

  • Distributed set cover approximation: Primal-dual with optimal locality

    Even, G., Ghaffari, M. & Medina, M., 1 Oct 2018, 32nd International Symposium on Distributed Computing, DISC 2018. Schmid, U. & Widder, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 121).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Online generalized caching with varying weights and costs

    Even, G., Medina, M. & Rawitz, D., 11 Jul 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 205-212 8 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations

  • Survivable network design for group connectivity in low-treewidth graphs

    Chalermsook, P., Das, S., Even, G., Laekhanukit, B. & Vaz, D., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations
  • 2017

    Sublinear random access generators for preferential attachment graphs

    Even, G., Levi, R., Medina, M. & Rosén, A., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Three notes on distributed property testing

    Even, G., Fischer, O., Fraigniaud, P., Gonen, T., Levi, R., Medina, M., Montealegre, P., Olivetti, D., Oshman, R., Rapaport, I. & Todinca, I., 1 Oct 2017, 31st International Symposium on Distributed Computing, DISC 2017. Richa, A. W. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 91).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    32 Scopus citations
  • 2016

    A constant approximation algorithm for scheduling packets on line networks

    Even, G., Medina, M. & Rosén, A., 1 Aug 2016, 24th Annual European Symposium on Algorithms, ESA 2016. Zaroliagis, C. & Sankowski, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 57).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • An approximation algorithm for path computation and function placement in SDNs

    Even, G., Rost, M. & Schmid, S., 2016, Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Revised Selected Papers. Suomela, J. (ed.). Springer Verlag, p. 374-390 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9988 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    29 Scopus citations

  • On-line path computation and function placement in SDNs

    Even, G., Medina, M. & Shamir, B. P., 2016, Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Petit, F. & Bonakdarpour, B. (eds.). Springer Verlag, p. 131-147 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10083 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations
  • 2015

    A 3/2-approximation algorithm for augmenting the edge-connectivity of a graph from 1 to 2 using a subset of a given edge set (Extended abstract)

    Even, G., Feldman, J., Kortsarz, G. & Nutov, Z., 2015, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation, Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Proceedings. Trevisan, L., Jansen, K., Goemans, M. & Rolim, J. D. P. (eds.). Springer Verlag, p. 90-101 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2129).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Better deterministic online packet routing on grids

    Even, G., Medina, M. & Patt-Shamir, B., 13 Jun 2015, SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 284-293 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 2015-June).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    7 Scopus citations

  • Deterministic rateless codes for BSC [extended abstract]

    Applebaum, B., David, L. & Even, G., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. Association for Computing Machinery, Inc, p. 31-40 10 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • Distributed maximum matching in bounded degree graphs

    Even, G., Medina, M. & Ron, D., 4 Jan 2015, ICDCN 2015 - Proceedings of the 16th International Conference on Distributed Computing and Networking. Association for Computing Machinery, (ACM International Conference Proceeding Series; vol. 04-07-January-2015).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    2 Scopus citations
  • 2014

    Deterministic stateless centralized local algorithms for bounded degree graphs

    Even, G., Medina, M. & Ron, D., 2014, Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag, p. 394-405 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8737 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    24 Scopus citations
  • 2013

    A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations

    Even, G. & Medina, M., 2013, Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers. p. 104-115 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8179 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Online multi-commodity flow with high demands

    Even, G. & Medina, M., 2013, Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. p. 16-29 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7846 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2012

    Competitive and deterministic embeddings of virtual networks

    Even, G., Medina, M., Schaffrath, G. & Schmid, S., 2012, Distributed Computing and Networking - 13th International Conference, ICDCN 2012, Proceedings. p. 106-121 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7129 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    19 Scopus citations

  • Hierarchies of local-optimality characterizations in decoding Tanner codes

    Halabi, N. & Even, G., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 2691-2695 5 p. 6284008. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • Linear-programming decoding of Tanner codes with local-optimality certificates

    Halabi, N. & Even, G., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 2686-2690 5 p. 6284007. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Local-optimality guarantees for optimal decoding based on paths

    Halabi, N. & Even, G., 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012. p. 205-209 5 p. 6325228. (International Symposium on Turbo Codes and Iterative Information Processing, ISTC).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Message-passing decoding beyond the girth with local-optimality guarantees

    Halabi, N. & Even, G., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6376924. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Multi-hop routing and scheduling in wireless networks in the SINR model

    Even, G., Matsri, Y. & Medina, M., 2012, Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers. p. 202-214 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7111 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    3 Scopus citations

  • Observability of boolean networks is NP-hard

    Laschov, D., Margaliot, M. & Even, G., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6377137. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Real-time video streaming in multi-hop wireless static ad hoc networks

    Even, G., Fais, Y., Medina, M., Shahar, S. & Zadorojniy, A., 2012, Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Revised Selected Papers. p. 188-201 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7111 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2011

    Hitting sets online and vertex ranking

    Even, G. & Smorodinsky, S., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 347-357 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Online packet-routing in grids with bounded buffers

    Even, G. & Medina, M., 2011, SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. p. 215-224 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Scopus citations
  • 2010

    An O(logn)-competitive online centralized randomized packet-routing algorithm for lines

    Even, G. & Medina, M., 2010, Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2 ed. p. 139-150 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6199 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • LP decoding of regular LDPC codes in memoryless channels

    Halabi, N. & Even, G., 2010, 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. p. 744-748 5 p. 5513612. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    3 Scopus citations

  • Parallel randomized load balancing: A lower bound for a more general model

    Even, G. & Medina, M., 2010, SOFSEM 2010: Theory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 358-369 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5901 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations

  • Revisiting randomized parallel load balancing algorithms

    Even, G. & Medina, M., 2010, Structural Information and Communication Complexity - 16th International Colloquium, SIROCCO 2009, Revised Selected Papers. p. 209-221 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5869 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2008

    An improved micro-architecture for function approximation using piecewise quadratic interpolation

    Erez, S. & Even, G., 2008, 26th IEEE International Conference on Computer Design 2008, ICCD. p. 422-426 5 p. 4751895. (26th IEEE International Conference on Computer Design 2008, ICCD).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    2 Scopus citations

  • Set connectivity problems in undirected graphs and the directed Steiner network problem

    Chekuri, C., Even, G., Gupta, A. & Segev, D., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 532-541 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    21 Scopus citations
  • 2007

    An FPGA implementation of pipelined multiplicative division with IEEE Rounding

    Goldberg, R., Even, G. & Seidel, P.-M., 2007, 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2007). IEEE, p. 185-196 12 p. 4297255. (Proceedings 2007 IEEE Symposium on Field-Programme Custom Computing Machines, FCCM 2007).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Optimal conclusive sets for comparator networks

    Even, G., Levi, T. & Litman, A., 2007, Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings. Springer Verlag, p. 304-317 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4474 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2006

    Approximation algorithms for capacitated rectangle stabbing

    Even, G., Rawitz, D. & Shahar, S., 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Verlag, p. 18-29 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Scopus citations

  • Scheduling of a smart antenna: Capacitated coloring of unit circular-arc graphs

    Even, G. & Shahar, S., 2006, Combinatorial and Algorithmic Aspects of Networking - Third Workshop, CAAN 2006, Revised Papers. p. 58-71 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4235 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2002

    An approximation algorithm for the Group Steiner Problem

    Even, G. & Kortsarz, G., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 49-58 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations

  • On network design problems: Fixed cost flows and the covering steiner problem

    Even, G., Kortsarz, G. & Slany, W., 2002, Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings. Penttonen, M. & Schmidt, E. M. (eds.). Springer Verlag, p. 318-327 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2368).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    11 Scopus citations
  • 2000

    Improved approximations of crossings in graph drawings

    Even, G., Guha, S. & Schieber, B., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 296-305 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations