Carla Binucci

Applied Filters

Carla Binucci
AuthorRemove filter

Clear all

People

Colleagues

Carla Binucci (29)
Walter Didimo (23)
Fabrizio Montecchiani (10)
Giuseppe Liotta (10)
Maurizio Patrignani (10)
Emilio Di Giacomo (8)
Antonios Symvonis (5)
Ioannis G Tollis (5)
Alessandra Tappini (4)
Maddalena Nonato (3)
Martin Gronemann (3)
Francesco Giordano (2)
Giuseppe Di Battista (2)
Karsten Klein (2)
Luca Grilli (2)
Marco Gaertler (2)
Martin Nöllenburg (2)
Pat Ryan Morin (2)
Seok-hee Hong (2)
Ulrik Brandes (2)

Publication

Journal/Magazine Names

Computational Geometry: Theory and Applications (5)
Theoretical Computer Science (2)
Algorithmica (1)
Expert Systems with Applications: An International Journal (1)
Information Processing Letters (1)
Journal of Computer and System Sciences (1)

Proceedings/Book Names

Graph Drawing and Network Visualization (2)
Graph Drawing and Network Visualization (2)
Computing and Software Science (1)
GD '01: Revised Papers from the 9th International Symposium on Graph Drawing (1)
GD '02: Revised Papers from the 10th International Symposium on Graph Drawing (1)
GD 2013: Revised Selected Papers of the 21st International Symposium on Graph Drawing - Volume 8242 (1)
GD 2014: Revised Selected Papers of the 22nd International Symposium on Graph Drawing - Volume 8871 (1)
GD'07: Proceedings of the 15th international conference on Graph drawing (1)
GD'09: Proceedings of the 17th international conference on Graph Drawing (1)
GD'11: Proceedings of the 19th international conference on Graph Drawing (1)
Graph Drawing and Network Visualization (1)
Graph Drawing and Network Visualization (1)
Graph Drawing and Network Visualization (1)
Graph-Theoretic Concepts in Computer Science (1)
WALCOM'10: Proceedings of the 4th international conference on Algorithms and Computation (1)
WALCOM: Algorithms and Computation (1)

All Publications

Proceedings (17)
Other periodicals (11)
Books (1)

Publisher

Springer-Verlag (19)
Elsevier Science Publishers B. V. (5)
Elsevier Science Publishers Ltd. (2)
Academic Press, Inc. (1)
Elsevier North-Holland, Inc. (1)
Pergamon Press, Inc. (1)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

29 Results for: Author: Carla BinucciEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,753,924 records)|Limit your search to The ACM Full-Text Collection (756,977 records)

Results

Showing 1 - 20of29 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
On the complexity of the storyplan problem
- Carla Binucci
  Department of Engineering, University of Perugia, Italy
  ,
- Emilio Di Giacomo
  Department of Engineering, University of Perugia, Italy
  ,
- William J. Lenhart
  Department of Computer Science, Williams College, USA
  ,
- Giuseppe Liotta
  Department of Engineering, University of Perugia, Italy
  ,
- Fabrizio Montecchiani
  Department of Engineering, University of Perugia, Italy
  ,
- Martin Nöllenburg
  Algorithms and Complexity Group, TU Wien, Vienna, Austria
  ,
- Antonios Symvonis
  School of Applied Mathematical & Physical Sciences, NTUA, Greece
Journal of Computer and System Sciences, Volume 139, Issue C•Feb 2024 • https://doi.org/10.1016/j.jcss.2023.103466
Abstract
We study the problem of representing a graph as a storyplan, a recently introduced model for dynamic graph visualization. It is based on a sequence of frames, each showing a subset of vertices and a planar drawing of their induced subgraphs, ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Min-k-planar Drawings of Graphs
- Carla Binucci
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Aaron Büngener
  https://ror.org/03a1kwz48University of Tübingen, Tübingen, Germany
  ,
- Giuseppe Di Battista
  https://ror.org/05vf0dg29Università Roma Tre, Rome, Italy
  ,
- Walter Didimo
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Vida Dujmović
  https://ror.org/03c4mmv16University of Ottawa, Ottawa, Canada
  ,
- Seok-Hee Hong
  https://ror.org/0384j8v12University of Sydney, Sydney, Australia
  ,
- Michael Kaufmann
  https://ror.org/03a1kwz48University of Tübingen, Tübingen, Germany
  ,
- Giuseppe Liotta
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Pat Morin
  https://ror.org/02qtvee93Carleton University, Ottawa, Canada
  ,
- Alessandra Tappini
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
Graph Drawing and Network Visualization•September 2023, pp 39-52• https://doi.org/10.1007/978-3-031-49272-3_3
Abstract
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the k-...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Evaluating Animation Parameters for Morphing Edge Drawings
- Carla Binucci
  https://ror.org/00x27da85University of Perugia, Perugia, Italy
  ,
- Henry Förster
  https://ror.org/03a1kwz48University of Tübingen, Tübingen, Germany
  ,
- Julia Katheder
  https://ror.org/03a1kwz48University of Tübingen, Tübingen, Germany
  ,
- Alessandra Tappini
  https://ror.org/00x27da85University of Perugia, Perugia, Italy
Graph Drawing and Network Visualization•September 2023, pp 246-262• https://doi.org/10.1007/978-3-031-49272-3_17
Abstract
Partial edge drawings (ped) of graphs avoid edge crossings by subdividing each edge into three parts and representing only its stubs, i.e., the parts incident to the end-nodes. The morphing edge drawing model (med) extends the ped drawing style by ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Nonplanar Graph Drawings with k Vertices per Face
- Carla Binucci
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Giuseppe Di Battista
  https://ror.org/05vf0dg29Università degli Studi Roma Tre, Rome, Italy
  ,
- Walter Didimo
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Seok-Hee Hong
  https://ror.org/0384j8v12University of Sydney, Camperdown, Australia
  ,
- Michael Kaufmann
  https://ror.org/03a1kwz48University of Tübingen, Tübingen, Germany
  ,
- Giuseppe Liotta
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
  ,
- Pat Morin
  https://ror.org/02qtvee93Carleton University, Ottawa, Canada
  ,
- Alessandra Tappini
  https://ror.org/00x27da85Università degli Studi di Perugia, Perugia, Italy
Graph-Theoretic Concepts in Computer Science•June 2023, pp 86-100• https://doi.org/10.1007/978-3-031-43380-1_7
Abstract
The study of nonplanar graph drawings with forbidden or desired crossing configurations has a long tradition in geometric graph theory, and received an increasing attention in the last two decades, under the name of beyond-planar graph drawing. In ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
- Carla Binucci
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Giordano Da Lozzo
  https://ror.org/05vf0dg29Department of Engineering, Roma Tre University, Rome, Italy
  ,
- Emilio Di Giacomo
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Walter Didimo
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Tamara Mchedlidze
  https://ror.org/04pp8hn57Utrecht University, Utrecht, The Netherlands
  ,
- Maurizio Patrignani
  https://ror.org/05vf0dg29Department of Engineering, Roma Tre University, Rome, Italy
Algorithmica, Volume 85, Issue 12•Dec 2023, pp 3521-3571 • https://doi.org/10.1007/s00453-023-01142-y
Abstract
A k-page upward book embedding (kUBE) of a directed acyclic graph G is a book embeddings of G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book. The kUBE Testing problem, ... $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
On the Complexity of the Storyplan Problem
- Carla Binucci
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Emilio Di Giacomo
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- William J. Lenhart
  https://ror.org/04avkmd49Department of Computer Science, Williams College, Williamstown, USA
  ,
- Giuseppe Liotta
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Fabrizio Montecchiani
  https://ror.org/00x27da85Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Martin Nöllenburg
  https://ror.org/04d836q62Algorithms and Complexity Group, TU Wien, Vienna, Austria
  ,
- Antonios Symvonis
  School of Applied Mathematical and Physical Sciences, NTUA, Athens, Greece
Graph Drawing and Network Visualization•September 2022, pp 304-318• https://doi.org/10.1007/978-3-031-22203-0_22
Abstract
Motivated by dynamic graph visualization, we study the problem of representing a graph G in the form of a storyplan, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of G induced by a ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
st-Orientations with Few Transitive Edges
- Carla Binucci
  https://ror.org/00x27da85Universià degli Studi di Perugia, Perugia, Italy
  ,
- Walter Didimo
  https://ror.org/00x27da85Universià degli Studi di Perugia, Perugia, Italy
  ,
- Maurizio Patrignani
  https://ror.org/05vf0dg29Roma Tre University, Rome, Italy
Graph Drawing and Network Visualization•September 2022, pp 201-216• https://doi.org/10.1007/978-3-031-22203-0_15
Abstract
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph theory and is central to many graph drawing algorithms. Such an ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
1-planarity testing and embedding: An experimental study
- Carla Binucci
  Università degli Studi di Perugia, Italy
  ,
- Walter Didimo
  Università degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Università degli Studi di Perugia, Italy
Computational Geometry: Theory and Applications, Volume 108, Issue C•Jan 2023 • https://doi.org/10.1016/j.comgeo.2022.101900
Abstract
Many papers study the natural problem of drawing nonplanar graphs with few crossings per edge. In particular, a graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
chapter
10 Reasons to Get Interested in Graph Drawing
- Carla Binucci
  University of Perugia, Perugia, Italy
  ,
- Ulrik Brandes
  ETH Zurich, Zurich, Switzerland
  ,
- Tim Dwyer
  Monash University, Melbourne, Australia
  ,
- Martin Gronemann
  University of Cologne, Cologne, Germany
  ,
- Reinhard von Hanxleden
  Kiel University, Kiel, Germany
  ,
- Marc van Kreveld
  Utrecht University, Utrecht, The Netherlands
  ,
- Petra Mutzel
  TU Dortmund University, Dortmund, Germany
  ,
- Marcus Schaefer
  DePaul University, Chicago, USA
  ,
- Falk Schreiber
  University of Konstanz, Konstanz, Germany
  ,
- Bettina Speckmann
  TU Eindhoven, Eindhoven, The Netherlands
Computing and Software Science, pp 85-104• https://doi.org/10.1007/978-3-319-91908-9_6
Abstract
This is an invitation to the research area of graph drawing. It encompasses basic research such as graph theory, complexity theory, data structures, and graph algorithms as well as applied research such as software libraries, implementations, and ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
Quasi-upward Planar Drawings with Minimum Curve Complexity
- Carla Binucci
  Università degli Studi di Perugia, Perugia, Italy
  ,
- Emilio Di Giacomo
  Università degli Studi di Perugia, Perugia, Italy
  ,
- Giuseppe Liotta
  Università degli Studi di Perugia, Perugia, Italy
  ,
- Alessandra Tappini
  Università degli Studi di Perugia, Perugia, Italy
Graph Drawing and Network Visualization•September 2021, pp 195-209• https://doi.org/10.1007/978-3-030-92931-2_14
Abstract
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane digraph ... $\overset{}{}^{\frac{}{}}$
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
Article
On Turn-Regular Orthogonal Representations
- Michael A. Bekos
  Department of Computer Science, University of Tübingen, Tübingen, Germany
  ,
- Carla Binucci
  Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Giuseppe Di Battista
  Department of Engineering, Roma Tre University, Rome, Italy
  ,
- Walter Didimo
  Department of Engineering, University of Perugia, Perugia, Italy
  ,
- Martin Gronemann
  Theoretical Computer Science, Osnabrück University, Osnabrück, Germany
  ,
- Karsten Klein
  Department of Computer and Information Science, University of Konstanz, Konstanz, Germany
  ,
- Maurizio Patrignani
  Department of Engineering, Roma Tre University, Rome, Italy
  ,
- Ignaz Rutter
  Department of Computer Science and Mathematics, University of Passau, Passau, Germany
Graph Drawing and Network Visualization•September 2020, pp 250-264• https://doi.org/10.1007/978-3-030-68766-3_20
Abstract
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that “point to each other” inside a face. For such a representation H it is possible to ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm
- Carla Binucci
  Università degli Studi di Perugia, Perugia, Italy
  ,
- Walter Didimo
  Università degli Studi di Perugia, Perugia, Italy
  ,
- Fabrizio Montecchiani
  Università degli Studi di Perugia, Perugia, Italy
WALCOM: Algorithms and Computation•March 2020, pp 329-335• https://doi.org/10.1007/978-3-030-39881-1_28
Abstract
A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. The 1-planarity testing problem is NP-complete, even for restricted classes of graphs. We present the first general 1-planarity testing and embedding algorithm,...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Designing the Content Analyzer of a Travel Recommender System
- Carla Binucci
  Dipartimento di Ingegneria, Universit degli Studi di Perugia, Italy
  ,
- Felice De Luca
  Dipartimento di Ingegneria, Universit degli Studi di Perugia, Italy
  ,
- Emilio Di Giacomo
  Dipartimento di Ingegneria, Universit degli Studi di Perugia, Italy
  ,
- Giuseppe Liotta
  Dipartimento di Ingegneria, Universit degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Dipartimento di Ingegneria, Universit degli Studi di Perugia, Italy
Expert Systems with Applications: An International Journal, Volume 87, Issue C•November 2017, pp 199-208 • https://doi.org/10.1016/j.eswa.2017.06.028

We designed the Content Analyzer for a travel recommender system.Our system is unsupervised, automatic, and relies only on public data sources.The system effectiveness has been tested against a ground truth made by experts.We developed and published on-...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- Patrizio Angelini
  Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany
  ,
- Carla Binucci
  Dipartimento di Ingegneria, Università degli Studi di Perugia, Italy
  ,
- Giordano Da Lozzo
  Dipartimento di Ingegneria, Università Roma Tre, Italy
  ,
- Walter Didimo
  Dipartimento di Ingegneria, Università degli Studi di Perugia, Italy
  ,
- Luca Grilli
  Dipartimento di Ingegneria, Università degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Dipartimento di Ingegneria, Università degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Dipartimento di Ingegneria, Università Roma Tre, Italy
  ,
- Ioannis G. Tollis
  University of Crete and Institute of Computer Science, FORTH, Greece
Computational Geometry: Theory and Applications, Volume 50, Issue C•December 2015, pp 34-48 • https://doi.org/10.1016/j.comgeo.2015.07.002

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing of G in the plane such that the edges of S are not crossed in by any edge of G__ __ We give positive and ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus
- Carla Binucci
  Università Degli Studi di Perugia, Perugia, Italy
  ,
- Markus Chimani
  Osnabrück University, Osnabrück, Germany
  ,
- Walter Didimo
  Università Degli Studi di Perugia, Perugia, Italy
  ,
- Martin Gronemann
  University of Cologne, Cologne, Germany
  ,
- Karsten Klein
  Monash University, Melbourne, Australia
  ,
- Jan Kratochvíl
  Charles University, Prague, Czech Republic
  ,
- Fabrizio Montecchiani
  Università Degli Studi di Perugia, Perugia, Italy
  ,
- Ioannis G. Tollis
  University of Crete and Institute of Computer Science-FORTH, Crete, Greece
Graph Drawing and Network Visualization, pp 281-294• https://doi.org/10.1007/978-3-319-27261-0_24
Abstract
In a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fan-planar drawings such that the vertices are assigned to two distinct horizontal layers and edges are ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Fan-planarity
- Carla Binucci
  Dipartimento di Ingegneria, Universitá degli Studi di Perugia, Italy
  ,
- Emilio Di Giacomo
  Dipartimento di Ingegneria, Universitá degli Studi di Perugia, Italy
  ,
- Walter Didimo
  Dipartimento di Ingegneria, Universitá degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Dipartimento di Ingegneria, Universitá degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Dipartimento di Ingegneria, Universitá Roma Tre, Italy
  ,
- Antonios Symvonis
  Department of Mathematics, National Technical University of Athens, Greece
  ,
- Ioannis G. Tollis
  University of Crete and Institute of Computer Science-FORTH, Greece
Theoretical Computer Science, Volume 589, Issue C•July 2015, pp 76-86 • https://doi.org/10.1016/j.tcs.2015.04.020

In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt 35], who proved that every n-vertex fan-planar drawing has at most 5 n - 10 edges, and ...
10Citation
Metrics
Total Citations10
Export Citations
Save to Binder
Article
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
- Carla Binucci
  Universití degli Studi di Perugia, Italy
  ,
- Emilio Giacomo
  Universití degli Studi di Perugia, Italy
  ,
- Walter Didimo
  Universití degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Universití degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Universití Roma Tre, Italy
  ,
- Ioannis G. Tollis
  Univ. of Crete and Institute of Computer Science-FORTH, Greece
GD 2014: Revised Selected Papers of the 22nd International Symposium on Graph Drawing - Volume 8871•September 2014, pp 186-197• https://doi.org/10.1007/978-3-662-45803-7_16

In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who proved that every n -vertex fan-planar drawing has at most 5 n -10 edges, and ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
article
Upward and quasi-upward planarity testing of embedded mixed graphs
- Carla Binucci
  Dipartimento di Ingegneria, Universití degli Studi di Perugia, Italy
  ,
- Walter Didimo
  Dipartimento di Ingegneria, Universití degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Dipartimento di Ingegneria, Universití Roma Tre, Italy
Theoretical Computer Science, Volume 526•March, 2014, pp 75-89 • https://doi.org/10.1016/j.tcs.2014.01.015

Mixed graphs have both directed and undirected edges and have received considerable attention in the literature. We study two upward planarity testing problems for embedded mixed graphs, give some NP-hardness results, and describe Integer Linear ...
9Citation
Metrics
Total Citations9
Export Citations
Save to Binder
Article
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
- Patrizio Angelini
  Universití Roma Tre, Italy
  ,
- Carla Binucci
  Universití degli Studi di Perugia, Italy
  ,
- Giordano Lozzo
  Universití Roma Tre, Italy
  ,
- Walter Didimo
  Universití degli Studi di Perugia, Italy
  ,
- Luca Grilli
  Universití degli Studi di Perugia, Italy
  ,
- Fabrizio Montecchiani
  Universití degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Universití Roma Tre, Italy
  ,
- Ioannis G. Tollis
  Institute of Computer Science-FORTH, Univ. of Crete, Greece
GD 2013: Revised Selected Papers of the 21st International Symposium on Graph Drawing - Volume 8242•September 2013, pp 292-303• https://doi.org/10.1007/978-3-319-03841-4_26

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the edges of S are not crossed in Γ __ __ We give positive and negative ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
article
Drawing trees in a streaming model
- Carla Binucci
  Dipartimento di Ing. Elettronica e dellInformazione, Universití degli Studi di Perugia, Italy
  ,
- Ulrik Brandes
  Department of Computer and Information Science, University of Konstanz, Germany
  ,
- Giuseppe Di Battista
  Dipartimento di Informatica e Automazione, Universití Roma Tre, Italy
  ,
- Walter Didimo
  Dipartimento di Ing. Elettronica e dellInformazione, Universití degli Studi di Perugia, Italy
  ,
- Marco Gaertler
  Institute of Theoretical Computer Science, University of Karlsruhe, Germany
  ,
- Pietro Palladino
  Dipartimento di Medicina Sperimentale e Scienze Biochimiche, Universití degli Studi di Perugia, Italy
  ,
- Maurizio Patrignani
  Dipartimento di Informatica e Automazione, Universití Roma Tre, Italy
  ,
- Antonios Symvonis
  Department of Mathematics, National Technical University of Athens, Greece
  ,
- Katharina Zweig
  Interdisciplinary Center for Scientific Computing (IWR), University of Heidelberg, Germany
Information Processing Letters, Volume 112, Issue 11•June, 2012, pp 418-422 • https://doi.org/10.1016/j.ipl.2012.02.011

We pose a new visualization challenge, asking Graph Drawing algorithms to cope with the requirements of Streaming applications. In this model a source produces a graph one edge at a time. When an edge is produced, it is immediately drawn and its ...
9Citation
Metrics
Total Citations9
Export Citations
Save to Binder

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner