_____
 ____  __
  ______     _______
    ____________________
           _______________
          _________________
          ________________
           ______________
            ____________
            __________
            ________
            _______
            _____
            _____
            ___
            ___
            ___


  Chair


Francisco Rodríguez Henríquez (Conference chair), Centro de investigación y de Estudios Avanzados, México. Cryptography Research Centre, TII, Abu Dhabi, United Arab Emirates
Armando Castañeda (Program Committee chair), Universidad Nacional Autónoma de México, México
Tássio Naia (Publicity Chair), Universidade de São Paulo, Brazil
Mariano Rivera Meraz (Organizing Committee chair), CIMAT, Guanajuato, México
Edgar Leonel Chávez González (Tutorial chair), CICESE, Ensenada, México

[Top] [Home] [All LATIN Chairs]

  Program Committee


Martin Aumüller, University of Copenhagen, Denmark
Jérémy Barbay, Universidad de Chile, Chile
Leonid Barenboim, The Open University of Israel, Israel
Frédérique Bassino, Université Sorbonne Paris Nord, France
Luciana Buriol, Amazon, USA
Armando Castañeda (Chair), Universidad Nacional Autónoma de México, México
Witold Charatonik, University of Wrocław, Poland
Min Chih Lin, Universidad de Buenos Aires, Argentina
Amalia Duch Brown, Universitat Politècnica de Catalunya, Spain
Leah Epstein, University of Haifa, Israel
Martín Farach-Colton, Rutgers University, USA
Esteban Feuerstein, Universidad de Buenos Aires, Argentina
David Flores-Peñaloza, Universidad Nacional Autónoma de México, Mexico
Fedor Fomin, University of Bergen, Norway
Jesper Jansson, Kyoto University, Japan
Gabriela Jeronimo, Universidad de Buenos Aires, Argentina
Christos Kaklamanis, University of Patras & CTI "Diophantus", Greece
Shuji Kijima, Kyushu University, Japan
Gregory Kucherov, CNRS/LIGM, France
François Le Gall, Nagoya University, Japan
Jérémy Ledent, University of Strathclyde, UK
Reut Levi, IDC Herzliya, Israel
Giovanni Manzini, Università di Pisa, Italy
Andrea Marino, Università degli Studi di Firenze, Italy
Elvira Mayordomo, Universidad de Zaragoza, Spain
Marco Molinaro, Pontifical Catholic University of Rio de Janeiro, Brazil
Guilherme Oliveira Mota, Universidade de São Paulo, Brazil
Lucia Moura, University of Ottawa, Canada
Gonzalo Navarro, Universidad de Chile, Chile
Rafael Oliveira, University of Waterloo, Canada
Daniel Panario, Carleton University, Canada
Gopal Pandurangan, University of Houston, USA
Seth Pettie, University of Michigan, USA
Miguel A. Pizaña, Universidad Autónoma Metropolitana, Mexico
Igor Potapov, University of Liverpool, UK
Svetlana Puzynina, Sobolev Institute of Mathematics, Russia
Pablo Rotondo, Université Gustave Eiffel, France
Jared Saia, University of New Mexico, USA
Rodrigo I. Silveira, Universitat Politècnica de Catalunya, Spain
Mohit Singh, Georgia Tech, USA
José A. Soto, Universidad de Chile, Chile
Frank Stephan, National University of Singapore, Singapore
Martin Strauss, University of Michigan, USA
Subhash Suri, University of California, USA
Dimitrios M. Thilikos, LIRMM, Université de Montpellier, CNRS, Montpellier, France
Christopher Thraves, Universidad de Concepción, Chile
Denis Trystram, Université de Grenoble Alpes, France
Seeun William Umboh, The University of Sydney, Australia
Jorge Urrutia, Universidad Nacional Autónoma de México, Mexico
Alfredo Viola, Universidad de la República, Uruguay
Mikhail V. Volkov, Ural Federal University, Russia
Sebastian Wild, University of Liverpool, UK
Georg Zetzsche, Max Planck Institute, Germany

[Top] [Home] [All LATIN PCs]

  Organizing Committee


Mariano Rivera Meraz (Organizing Committee chair), CIMAT, Guanajuato, México
Leonel Edgar Chávez González (Tutorial chair), CICESE, Ensenada, México
Tássio Naia (Publicity Chair), Universidade de São Paulo, Brazil

[Top] [Home] [All LATIN Org. Committees]

  Invited Speakers


Jeffrey D. Ullman (Stanford University, USA), Abstractions in Computer Science Theory

The creative use of abstractions is central to computer science. But not all abstractions address the same kinds of problems. We identify four different reasons abstractions appear in computer-science theory, and focus on the "declarative abstractions," whose purpose is to raise the level at which we program. Important declarative abstractions appear in the theory of compiling and the theory of databases. We shall touch on the most important elements in those two fields.

David Eppstein (University of California, Irvine, USA), The Complexity of Iterated Reversible Computation

Reversible computation has been studied for over 60 years as a way to evade fundamental physical limits on the power needed for irreversible computational steps, and because quantum computing circuits are necessarily reversible. We study a class of problems based on computing the iterated values of a reversible function. The story leads through Thomason's lollipop algorithm in graph theory, circuit complexity, and reversible cellular automata, to card shuffling, the reflections of light in jewels, and curves on topological surfaces, and involves both PSPACE-hard problems and problems with unexpected polynomial-time algorithms.

Mauricio Osorio (Universidad de las Américas, Puebla, México), A Graph Theoretic Approach for Resilient Distributed Algorithms
Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependency on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as the Bitcoin network and cloud computing, introduce new security challenges that deserve urgent attention in both theory and practice. In this talk, I will present a unified framework for obtaining fast, resilient and secure distributed algorithms for fundamental graph problems. Our approach is based on a graph-theoretic perspective in which common notions of resilient requirements are translated into suitably tailored combinatorial graph structures. We will discuss recent developments along the following two lines of research: - Designing distributed algorithms that can handle various adversarial settings, such as, node crashes and Byzantine attacks. We will mainly provide general compilation schemes that are based on exploiting the high-connectivity of the graph. Our key focus will be on the efficiency of the resilient algorithms in terms of the number of communication rounds. - Initiating and establishing the theoretical exploration of security in distributed graph algorithms. Such a notion has been addressed before mainly in the context of secure multi-party computation (MPC). The heart of our approach is to develop new graph theoretical infrastructures to provide graphical secure channels between nodes in a communication network of an arbitrary topology. Finally, I will highlight future directions that call for strengthening the connections between the areas of fault tolerant network design, distributed graph algorithms and information theoretic security.

Merav Parter (Weizmann Institute of Science, Tel Aviv, Israel), A Graph Theoretic Approach for Resilient Distributed Algorithms
Abstract: Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependency on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as the Bitcoin network and cloud computing, introduce new security challenges that deserve urgent attention in both theory and practice. In this talk, I will present a unified framework for obtaining fast, resilient and secure distributed algorithms for fundamental graph pproblems. Our approach is based on a graph-theoretic perspective in which common notions of resilient requirements are translated into suitably tailored combinatorial graph structures. We will discuss recent developments along the following two lines of research:
  • Designing distributed algorithms that can handle various adversarial settings, such as, node crashes and Byzantine attacks. We will mainly provide general compilation schemes that are based on exploiting the high-connectivity of the graph. Our key focus will be on the efficiency of the resilient algorithms in terms of the number of communication rounds.
  • Initiating and establishing the theoretical exploration of security in distributed graph algorithms. Such a notion has been addressed before mainly in the context of secure multi-party computation (MPC). The heart of our approach is to develop new graph theoretical infrastructures to provide graphical secure channels between nodes in a communication network of an arbitrary topology.
Finally, I will highlight future directions that call for strengthening the connections between the areas of fault tolerant network design, distributed graph algorithms and information theoretic security.

[Top] [Home] [All LATIN Inv. Speakers]

  Papers


Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai and Hao-Tsung Yang, Obtaining Approximately Optimal and Diverse Solutions via Dispersion. [Bibtex]

Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering and Wiktor Zuba, Elastic-Degenerate String Matching with 1 Error. [Bibtex]

Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu and Markus Wallinger, Multidimensional Manhattan Preferences. [Bibtex]

Ramtin Afshar and Michael T. Goodrich, Exact Learning of Multitrees and Almost-Trees Using Path Queries. [Bibtex]

José D. Alvarado, Lucas Colucci, Roberto Parente and Victor Souza, On the Zero-Sum Ramsey Problem over \(\mathbb{Z}_2^d\). [Bibtex]

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep and R. Subashini, Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. [Bibtex]

Saman Bazargani, Ahmad Biniaz and Prosenjit Bose, Piercing Pairwise Intersecting Convex Shapes in the Plane. [Bibtex]

Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan and Isabella Ziccardi, Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). [Bibtex]

Marcelo Pinheiro Leite Benedito, Lucas P. Melo and Lehilton L. C. Pedrosa, A Parameterized Approximation Algorithm for the Multiple Allocation \(k\)-Hub Center. [Bibtex]

Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh and Shaily Verma, List Homomorphism: Beyond the Known Boundaries. [Bibtex]

Olivier Bodini, Antoine Genitrini and Mehdi Naima, A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. [Bibtex]

Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková and Arash Rafiey, Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. [Bibtex]

Nicolas Bonichon, Prosenjit Bose and Yan Garito, Local Routing Algorithms on Euclidean Spanners with Small Diameter. [Bibtex]

Prosenjit Bose, Jean-Lou De Carufel and Thomas C. Shermer, On the Zombie Number of Various Graph Classes. [Bibtex]

Nader H. Bshouty, Almost Optimal Proper Learning and Testing Polynomials. [Bibtex]

Claude Carlet, On APN Functions Whose Graphs are Maximal Sidon Sets. [Bibtex]

David Casas and Mikhail V. Volkov, Binary Completely Reachable Automata. [Bibtex]

Prasad Chaugule and Nutan Limaye, On the Closures of Monotone Algebraic Classes and Variants of the Determinant. [Bibtex]

Julien Courtiel, Paul Dorbec and Romain Lecoq, Theoretical Analysis of git bisect. [Bibtex]

Vasco Cruz and Ana Paula Tomás, On \(r\)-Guarding SCOTs - A New Family of Orthogonal Polygons. [Bibtex]

Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard and Bastien Rivier, Complexity Results on Untangling Red-Blue Matchings. [Bibtex]

Thomas Dissaux and Nicolas Nisse, Pathlength of Outerplanar Graphs. [Bibtex]

Amalia Duch, Conrado Martínez, Mercè Pons and Salvador Roura, Median and Hybrid Median \(K\)-Dimensional Trees. [Bibtex]

Andrzej Dudek, Jaroslaw Grytczuk and Andrzej Rucinski, Patterns in Ordered (random) Matchings. [Bibtex]

Cristina G. Fernandes, Carla Negri Lintzmayer and Phablo F. S. Moura, Approximations for the Steiner Multicycle Problem. [Bibtex]

François Le Gall and Daiki Suruga, Bounds on Oblivious Multiparty Quantum Communication Complexity. [Bibtex]

Waldo Gálvez and Víctor Verdugo, Approximation Schemes for Packing Problems with \(\ell_p\)-norm Diversity Constraints. [Bibtex]

Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman and Pawel Zylinski, On Vertex Guarding Staircase Polygons. [Bibtex]

Ludmila Glinskih and Artur Riazanov, MCSP is Hard for Read-Once Nondeterministic Branching Programs. [Bibtex]

Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos and Jayme Luiz Szwarcfiter, Weighted Connected Matchings. [Bibtex]

Renzo Gómez, Flávio Keidi Miyazawa and Yoshiko Wakabayashi, Tree 3-Spanners on Generalized Prisms of Graphs. [Bibtex]

Viktor Henriksson and Manfred Kufleitner, Conelikes and Ranker Comparisons. [Bibtex]

Félix Hernández and Gerardo Vega, On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures. [Bibtex]

Hannah Miller Hillberg, Erik Krohn and Alex Pahlow, On the Complexity of Half-Guarding Monotone Polygons. [Bibtex]

Seungbum Jo and Geunho Kim, Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. [Bibtex]

Tomasz Kociumaka, Gonzalo Navarro and Francisco Olivares, Near-Optimal Search Time in \(\delta\)-Optimal Space. [Bibtex]

Alane M. de Lima, Murilo V. G. da Silva and André Luís Vignatti, Estimating the Clustering Coefficient Using Sample Complexity Analysis. [Bibtex]

Sylvain Lombardy and Jacques Sakarovitch, The Net Automaton of a Rational Expression. [Bibtex]

Caroline Mattes and Armin Weiß, Improved Parallel Algorithms for Generalized Baumslag Groups. [Bibtex]

Augusto Modanese and Thomas Worsch, Embedding Arbitrary Boolean Circuits into Fungal Automata. [Bibtex]

Charis Papadopoulos and Athanasios E. Zisis, Computing and Listing Avoidable Vertices and Paths. [Bibtex]

Thomas Place and Marc Zeitoun, How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?. [Bibtex]

Carole Porrier and Thomas Fernique, A General Approach to Ammann Bars for Aperiodic Tilings. [Bibtex]

Antonio Restivo, Giuseppe Romana and Marinella Sciortino, String Attractors and Infinite Words. [Bibtex]

Caroline Aparecida de Paula Silva, Cândida Nunes da Silva and Orlando Lee, On \(\chi\)-Diperfect Digraphs with Stability Number Two. [Bibtex]

Thore Thießen and Jan Vahrenhold, Klee's Measure Problem Made Oblivious. [Bibtex]



[Top] [Home] [All LATIN Papers]

  Sponsors


TII (Technology Innovation Institute)
CRC (Cryptography Research Centre)
CIMAT (Centro de Investigación en Matemáticas, A.C.)
CINVESTAV (Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional)
CONACYT (Consejo Nacional de Ciencia y Tecnología)
UNAM (Universidad Nacional Autónoma de México)

[Top] [Home] [All LATIN Sponsors]

  Location


The 15th Latin American Theoretical Informatics Symposium will be held in Guanajuato, Mexico.

More information about meeting can be found at https://pakal.cs.cinvestav.mx/latin2022/.

Call for Papers for LATIN 2022

Dates

All deadlines are at 23:59 anywhere on earth.

Abstract Submission (extended)
May 27, 2022
Full Paper Submission (extended)
May 30, 2022
Notification
July 29, 2022
Camera Ready
August 19, 2022
Symposium
November 7–11, 2022

Scope and Topics

LATIN is devoted to different areas in theoretical computer science including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, foundations of data science and theoretical machine learning, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, quantum computing, and random structures.

Submission

Papers are to be submitted in PDF format using the EasyChair server (https://easychair.org/conferences/?conf=latin2022).

Submissions are limited to fifteen (15) single-column letter-size pages in Springer LNCS format (see LNCS author guidelines at http://www.springer.com/la/computer-science/lncs/conference-proceedings-guidelines). This limit does not include references. An optional appendix (to be read at the program committee's discretion) may be included if desired. Simultaneous submission of papers to any other conference with published proceedings, as well as the submission of previously published papers, is not allowed. Papers must be written in English. If there is a physical meeting, as hoped for, for each accepted paper at least one author must register and attend the symposium to present it. Moreover, an author cannot register for multiple papers. That is, each accepted paper must have its own registrant. An exception will be made if a group of one or more authors has more papers accepted than group members.

Proceedings

Accepted papers will appear in the proceedings of LATIN, which will be published in Springer Lecture Notes in Computer Science (http://www.springer.com/la/computer-science/lncs).

Algorithmica Special Issue

A Special Issue of ALGORITHMICA will be dedicated to selected paper of LATIN 2022.

Imre Simon Test of Time Award

As of 2012, the Imre Simon Test-of-Time Award is given to the LATIN paper deemed most influential among all those published at least ten years prior to the current edition of the conference. Papers published in the LATIN proceedings up to and including 2010 are eligible for the 2022 award.

Best Paper Award

Papers presented at the conference will be considered for the LATIN 2022 Alejandro Lopez-Ortiz Best Paper Award.

COVID-19 Pandemic

The state of the COVID-19 pandemic in October 2022 cannot be predicted now. We will do our best to have a meeting in person, but it may happen that some or all attendees participate online. Questions can be sent to: Latinconferenciachair2022@delta.cs.cinvestav.mx.

Conference Chair

Francisco Rodríguez Henríquez, Centro de investigación y de Estudios Avanzados, México. Cryptography Research Centre, TII, Abu Dhabi, United Arab Emirates.

Program Committee

  • Martin Aumüller, University of Copenhagen, Denmark
  • Jérémy Barbay, Universidad de Chile, Chile
  • Leonid Barenboim, The Open University of Israel, Israel
  • Frédérique Bassino, Université Sorbonne Paris Nord, France
  • Luciana Buriol, Amazon, USA
  • Armando Castañeda, Universidad Nacional Autónoma de México, Mexico (Chair)
  • Witold Charatonik, University of Wrocław, Poland
  • Min Chih Lin, Universidad de Buenos Aires, Argentina
  • Amalia Duch Brown, Universitat Politècnica de Catalunya, Spain
  • Leah Epstein, University of Haifa, Israel
  • Martín Farach-Colton, Rutgers University, USA
  • Esteban Feuerstein, Universidad de Buenos Aires, Argentina
  • David Flores-Peñaloza, Universidad Nacional Autónoma de México, Mexico
  • Fedor Fomin, University of Bergen, Norway
  • Jesper Jansson, Kyoto University, Japan
  • Gabriela Jeronimo, Universidad de Buenos Aires, Argentina
  • Christos Kaklamanis, University of Patras & CTI "Diophantus", Greece
  • Shuji Kijima, Kyushu University, Japan
  • Gregory Kucherov, CNRS/LIGM, France
  • François Le Gall, Nagoya University, Japan
  • Jérémy Ledent, University of Strathclyde, UK
  • Reut Levi, IDC Herzliya, Israel
  • Giovanni Manzini, Università di Pisa, Italy
  • Andrea Marino, Università degli Studi di Firenze, Italy
  • Elvira Mayordomo, Universidad de Zaragoza, Spain
  • Marco Molinaro, Pontifical Catholic University of Rio de Janeiro, Brazil
  • Guilherme Oliveira Mota, Universidade de São Paulo, Brazil
  • Lucia Moura, University of Ottawa, Canada
  • Gonzalo Navarro, Universidad de Chile, Chile
  • Rafael Oliveira, University of Waterloo, Canada
  • Daniel Panario, Carleton University, Canada
  • Gopal Pandurangan, University of Houston, USA
  • Seth Pettie, University of Michigan, USA
  • Miguel A. Pizaña, Universidad Autónoma Metropolitana, Mexico
  • Igor Potapov, University of Liverpool, UK
  • Svetlana Puzynina, Sobolev Institute of Mathematics, Russia
  • Pablo Rotondo, Université Gustave Eiffel, France
  • Jared Saia, University of New Mexico, USA
  • Rodrigo I. Silveira, Universitat Politècnica de Catalunya, Spain
  • Mohit Singh, Georgia Tech, USA
  • José A. Soto, Universidad de Chile, Chile
  • Frank Stephan, National University of Singapore, Singapore
  • Martin Strauss, University of Michigan, USA
  • Subhash Suri, University of California, USA
  • Dimitrios M. Thilikos, LIRMM, Université de Montpellier, CNRS, Montpellier, France
  • Christopher Thraves, Universidad de Concepción, Chile
  • Denis Trystram, Université de Grenoble Alpes, France
  • Seeun William Umboh, The University of Sydney, Australia
  • Jorge Urrutia, Universidad Nacional Autónoma de México, Mexico
  • Alfredo Viola, Universidad de la República, Uruguay
  • Mikhail V. Volkov, Ural Federal University, Russia
  • Sebastian Wild, University of Liverpool, UK
  • Georg Zetzsche, Max Planck Institute, Germany

Organizing Committee

  • Mariano Rivera Meraz, CIMAT, Guanajuato, México (Organizing Committee chair)
  • Édgar Leonel Chávez González, CICESE, Ensenada, México (Tutorial chair)
  • Tássio Naia, Universidade de São Paulo, Brazil (Publicity Chair)

Steering Committee

  • Michael A. Bender, Stony Brook University, USA
  • Cristina G. Fernandes, Universidade de São Paulo, Brazil
  • Joachim von zur Gathen, Bonn-Aachen International Center for Information Technology, Germany
  • Evangelos Kranakis, Carleton University, Canada
  • Conrado Martínez, Universitat Politècnica de Catalunya, Spain
  • Flávio Keidi Miyazawa, Universidade Estadual de Campinas, Brazil

[Top] [Home] [All LATIN Locations]

  Photos



[Top] [Home] [All LATIN Photos]

  Statistics


General:
No. of submissions 114
No. of accepted papers 46
% of accepted papers 40.4%
Total No. of authors 141
Avg. No. of authors per paper 3.07
No. of countries represented 28
 
No. of papers according to how many authors work in Latin-America
    At least one 10(21.7%)
    All 8(17.4%)


Statistics by Country of Author's Affiliation

Authors*Papers**

23.0(16.3%)6.75(14.7%)Brazil
19.7(13.9%)7.63(16.6%)France
16.0(11.3%)4.37(9.5%)USA
11.5(8.2%)2.80(6.1%)India
10.0(7.1%)2.17(4.7%)Italy
9.5(6.7%)2.98(6.5%)Canada
8.0(5.7%)3.83(8.3%)Germany
5.0(3.5%)1.00(2.2%)Austria
4.0(2.8%)1.00(2.2%)Spain
4.0(2.8%)1.67(3.6%)Chile
3.3(2.4%)0.56(1.2%)Netherlands
3.0(2.1%)0.83(1.8%)Poland
2.0(1.4%)1.00(2.2%)Japan
2.0(1.4%)1.00(2.2%)Russia
2.0(1.4%)1.00(2.2%)Mexico
2.0(1.4%)0.33(0.7%)Taiwan
2.0(1.4%)1.00(2.2%)Greece
2.0(1.4%)0.40(0.9%)Czech Republic
2.0(1.4%)1.00(2.2%)Portugal
2.0(1.4%)0.75(1.6%)UK
1.5(1.1%)1.25(2.7%)Israel
1.0(0.7%)0.60(1.3%)Norway
1.0(0.7%)0.17(0.4%)Sweden
1.0(0.7%)0.50(1.1%)Denmark
1.0(0.7%)0.17(0.4%)Michelle
1.0(0.7%)0.50(1.1%)South Korea
1.0(0.7%)0.50(1.1%)SouthKorea
0.5(0.4%)0.25(0.5%)Switzerland

Authors with n affiliations contributes 1/n to each affiliation.
** Papers with n authors contribute 1/n to each affiliation.


Statistics by Region of Author's Affiliation

Authors*Papers**

64.5(45.7%)21.68(47.1%)Europe
29.0(20.6%)9.42(20.5%)Latin-America
25.5(18.1%)7.35(16.0%)USA & Canada
18.5(13.1%)5.63(12.2%)Australia & Asia
2.0(1.4%)0.67(1.4%)
1.5(1.1%)1.25(2.7%)Middle East

Authors with n affiliations contributes 1/n to each affiliation.
** Papers with n authors contribute 1/n to each affiliation.


SouthKorea Kim, Geunho;
Michelle Zuba, Wiktor;

Africa

Australia & Asia

India Antony, Dhanyamol; Bhyravarapu, Sriram; Chaugule, Prasad; Das, Arun Kumar; Das, Sandip; Jana, Satyabrata; Pal, Sagartanu; Panolan, Fahad; Sandeep, R. B.; Saurabh, Saket; Subashini, R.; Verma, Shaily;
South Korea Jo, Seungbum;
Taiwan Tsai, Meng-Tsung; Yang, Hao-Tsung;
Japan Le Gall, François; Suruga, Daiki;
Russia Casas, David; Volkov, Mikhail V.;

Europe

France Bodini, Olivier; Bonichon, Nicolas; Carlet, Claude; Courtiel, Julien; da Fonseca, Guilherme Dias; Dissaux, Thomas; Dorbec, Paul; Fernique, Thomas; Garito, Yan; Genitrini, Antoine; Gerard, Yan; Lecoq, Romain; Lombardy, Sylvain; Naima, Mehdi; Nisse, Nicolas; Pissis, Solon P.; Place, Thomas; Porrier, Carole; Rivier, Bastien; Sakarovitch, Jacques; Stougie, Leen; Zeitoun, Marc;
UK Henriksson, Viktor; Souza, Victor;
Switzerland Riazanov, Artur;
Germany Kociumaka, Tomasz; Kufleitner, Manfred; Mattes, Caroline; Modanese, Augusto; Thießen, Thore; Vahrenhold, Jan; Weiß, Armin; Worsch, Thomas;
Portugal Cruz, Vasco; Tomás, Ana Paula;
Czech Republic Bok, Jan; Jedlicková, Nikola;
Austria Chen, Jiehua; Nöllenburg, Martin; Simola, Sofia; Villedieu, Anaïs; Wallinger, Markus;
Greece Papadopoulos, Charis; Zisis, Athanasios E.;
Italy Becchetti, Luca; Bernardini, Giulia; Clementi, Andrea E. F.; Denni, Riccardo; Pasquale, Francesco; Restivo, Antonio; Romana, Giuseppe; Sciortino, Marinella; Trevisan, Luca; Ziccardi, Isabella;
Poland Grytczuk, Jaroslaw; Rucinski, Andrzej; Zylinski, Pawel;
Denmark Limaye, Nutan;
Spain Duch, Amalia; Martínez, Conrado; Pons, Mercè; Roura, Salvador;
Sweden Nilsson, Bengt J.;
Netherlands Gabory, Estéban; Pissis, Solon P.; Stougie, Leen; Sweering, Michelle;
Norway Carlet, Claude; Saurabh, Saket;

Latin-America

Chile Gálvez, Waldo; Navarro, Gonzalo; Olivares, Francisco; Verdugo, Víctor;
Mexico Hernández, Félix; Vega, Gerardo;
Brazil Alvarado, José D.; Colucci, Lucas; da Silva, Cândida Nunes; da Silva, Murilo V. G.; de Lima, Alane M.; dos Santos, Vinicius F.; Fernandes, Cristina G.; Gomes, Guilherme C. M.; Gómez, Renzo; Lee, Orlando; Lintzmayer, Carla Negri; Masquio, Bruno Porto; Melo, Lucas P.; Miyazawa, Flávio Keidi; Moura, Phablo F. S.; Parente, Roberto; Pedrosa, Lehilton L. C.; Pinheiro Leite Benedito, Marcelo; Pinto, Paulo E. D.; Silva, Caroline Aparecida de Paula; Szwarcfiter, Jayme Luiz; Vignatti, André Luís; Wakabayashi, Yoshiko;

Middle East

Israel Bshouty, Nader H.; Riazanov, Artur;

USA & Canada

Canada Bazargani, Saman; Biniaz, Ahmad; Bose, Prosenjit; Brewster, Richard C.; De Carufel, Jean-Lou; Hell, Pavol; Porrier, Carole; Shermer, Thomas C.;
USA Afshar, Ramtin; C. S., Karthik; Dudek, Andrzej; Gao, Jie; Gibson-Lopez, Matt; Glinskih, Ludmila; Goodrich, Michael T.; Goswami, Mayank; Krohn, Erik; Miller Hillberg, Hannah; Pahlow, Alex; Rafiey, Arash; Rayford, Matthew; Soderman, Sean; Tsai, Shih-Yu;

[Top] [Home] [All LATIN Statistics]