Ignasi Sau

Applied Filters

Ignasi Sau
AuthorRemove filter

Clear all

People

Colleagues

Ignasi Sau (80)
Dimitrios M Thilikos (22)
Christophe A H Paul (11)
Julien Baste (8)
George B Mertzios (7)
Omid Amini (7)
Júlio Araújo (6)
Mordechai Shalom (6)
Saket Saurabh (6)
Shmuel Zaks (6)
Stéphane Pérennès (6)
Ana Karolinna Maia (5)
Fedor V. Fomin (5)
Jean Claude Bermond (5)
Victor A Campos (5)
David Peleg (4)
David Coudert (4)
Frederic Dorn (4)
Isolde Adler (4)
StÉphan ThomassÉ (4)

Roles

Editor

Publication

Journal/Magazine Names

Algorithmica (11)
Discrete Applied Mathematics (8)
SIAM Journal on Discrete Mathematics (8)
Theoretical Computer Science (8)
ACM Transactions on Algorithms (3)
Discrete Mathematics (3)
Journal of Computer and System Sciences (3)
Journal of Discrete Algorithms (2)
Theory of Computing Systems (2)
ACM Transactions on Computational Logic (1)
Electronic Notes in Theoretical Computer Science (ENTCS) (1)
Information and Computation (1)
Journal of Combinatorial Optimization (1)
Journal of Combinatorial Theory Series B (1)
Networks (1)
Procedia Computer Science (1)
SIAM Journal on Computing (1)

Proceedings/Book Names

Graph-Theoretic Concepts in Computer Science (2)
Algorithms and Computation (1)
Approximation and Online Algorithms (1)
Combinatorial Algorithms (1)
ESA'10: Proceedings of the 18th annual European conference on Algorithms: Part I (1)
ESA'11: Proceedings of the 19th European conference on Algorithms (1)
Graph-Theoretic Concepts in Computer Science (1)
Graph-Theoretic Concepts in Computer Science (1)
ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming (1)
ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II (1)
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I (1)
ISAAC'07: Proceedings of the 18th international conference on Algorithms and computation (1)
IWPEC'08: Proceedings of the 3rd international conference on Parameterized and exact computation (1)
NETWORKING '09: Proceedings of the 8th International IFIP-TC 6 Networking Conference (1)
SIROCCO'09: Proceedings of the 16th international conference on Structural Information and Communication Complexity (1)
SIROCCO'10: Proceedings of the 17th international conference on Structural Information and Communication Complexity (1)
SOFSEM'11: Proceedings of the 37th international conference on Current trends in theory and practice of computer science (1)
SWAT'10: Proceedings of the 12th Scandinavian conference on Algorithm Theory (1)
WG 2016: Revised Selected Papers of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9941 (1)
WG'12: Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science (1)

All Publications

Other periodicals (52)
Proceedings (18)
Books (5)
Journals (5)

Publisher

Springer-Verlag (36)
Elsevier Science Publishers B. V. (15)
Society for Industrial and Applied Mathematics (10)
Elsevier Science Publishers Ltd. (8)
Academic Press, Inc. (5)
Association for Computing Machinery (4)
IEEE Press (1)
Wiley-Interscience (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

80 Results for: Author: Ignasi SauEdit 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,797,964 records)|Limit your search to The ACM Full-Text Collection (768,182 records)

Results

Showing 1 - 20of80 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
Redicolouring digraphs: Directed treewidth and cycle-degeneracy
- Nicolas Nisse
  Université Côte d’Azur, CNRS, Inria, I3S, Sophia-Antipolis, France
  ,
- Lucas Picasarri-Arrieta
  Université Côte d’Azur, CNRS, Inria, I3S, Sophia-Antipolis, France
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, France
Discrete Applied Mathematics, Volume 356, Issue C•Oct 2024, pp 191-208 • https://doi.org/10.1016/j.dam.2024.05.042
Abstract
Given a digraph D = ( V , A ) on n vertices and a vertex v ∈ V, the cycle-degree of v is the minimum size of a set S ⊆ V ( D ) ∖ { v } intersecting every directed cycle of D containing v. From this definition of cycle-degree, we define the c-...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
free
Published By ACM
Published By ACM
Compound Logics for Modification Problems
- Fedor V. Fomin
  Department of Informatics, University of Bergen, Norway
  ,
- Petr A. Golovach
  Department of Informatics, University of Bergen, Norway
  ,
- Ignasi Sau
  LIRMM, Univ Montpellier, CNRS, France
  ,
- Giannos Stamoulis
  Institute of Informatics, University of Warsaw, Poland
  ,
- Dimitrios M. Thilikos
  LIRMM, Univ Montpellier, CNRS, France
ACM Transactions on Computational Logic, Volume 0, Issue ja • https://doi.org/10.1145/3696451
We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with two types of sentences, ...
0Citation
35
Downloads
Metrics
Total Citations0
Total Downloads35
Last 12 Months35
Last 6 weeks19
Export Citations
Save to Binder
View online with eReader
PDF
research-article
FPT algorithms for packing k-safe spanning rooted sub(di)graphs
- Stéphane Bessy
  LIRMM, Univ Montpellier, CNRS, Montpellier, France
  ,
- Florian Hörsch
  CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  ,
- Ana Karolinna Maia
  Departamento de Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Dieter Rautenbach
  Institute of Optimization and Operations Research, Ulm University, Germany
  ,
- Ignasi Sau
  LIRMM, Univ Montpellier, CNRS, Montpellier, France
Discrete Applied Mathematics, Volume 346, Issue C•Mar 2024, pp 80-94 • https://doi.org/10.1016/j.dam.2023.11.026
Abstract
We study three problems introduced by Bang-Jensen and Yeo (2015) and by Bang-Jensen et al. (2016) about finding disjoint “balanced” spanning rooted substructures in graphs and digraphs, which generalize classic packing problems such as detecting ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Target set selection with maximum activation time
- Lucas Keiler
  Dept. Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Carlos Vinicius Gomes Costa Lima
  Centro de Ciências e Tecnologia, Universidade Federal do Cariri, Juazeiro do Norte, Brazil
  ,
- Ana Karolinna Maia
  Dept. Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Rudini Sampaio
  Dept. Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
Discrete Applied Mathematics, Volume 338, Issue C•Oct 2023, pp 199-217 • https://doi.org/10.1016/j.dam.2023.06.004
Abstract
A target set selection model is a graph G with a threshold function τ : V ( G ) → N upper-bounded by the vertex degree. For a given model, a set S 0 ⊆ V ( G ) is a target set if V ( G ) can be partitioned into non-empty subsets S 0 , S ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Reducing the vertex cover number via edge contractions
- Paloma T. Lima
  Computer Science Department, IT University of Copenhagen, Denmark
  ,
- Vinicius F. dos Santos
  Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Uéverton S. Souza
  Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
  Institute of Informatics, University of Warsaw, Warsaw, Poland
  ,
- Prafullkumar Tale
  Department of Mathematics, Indian Institute of Science Education and Research Pune, Pune, India
Journal of Computer and System Sciences, Volume 136, Issue C•Sep 2023, pp 63-87 • https://doi.org/10.1016/j.jcss.2023.03.003
Abstract
Given a graph G on n vertices and two integers k and d, the Contraction(vc) problem asks whether one can contract at most k edges to reduce the vertex cover number of G by at least d. Recently, Lima et al. [JCSS 2021] proved that ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
k-apices of minor-closed graph classes. I. Bounding the obstructions
- Ignasi Sau
  LIRMM, Univ Montpellier, CNRS, Montpellier, France
  ,
- Giannos Stamoulis
  LIRMM, Univ Montpellier, CNRS, Montpellier, France
  ,
- Dimitrios M. Thilikos
  LIRMM, Univ Montpellier, CNRS, Montpellier, France
Journal of Combinatorial Theory Series B, Volume 161, Issue C•Jul 2023, pp 180-227 • https://doi.org/10.1016/j.jctb.2023.02.012
Abstract
Let G be a minor-closed graph class. We say that a graph G is a k-apex of G if G contains a set S of at most k vertices such that G ∖ S belongs to G. We denote by A k ( G ) the set of all graphs that are k-apices of G. We prove that every graph ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Hardness and Approximation of Traffic Grooming
- Omid Amini
  Mascotte joint Project I3S (CNRS/UNSA) and INRIA - 2004, route des Lucioles - Sophia-Antipolis, France
  École Polytechnique - Palaiseau, France
  ,
- Stéphane Pérennes
  Mascotte joint Project I3S (CNRS/UNSA) and INRIA - 2004, route des Lucioles - Sophia-Antipolis, France
  ,
- Ignasi Sau
  Mascotte joint Project I3S (CNRS/UNSA) and INRIA - 2004, route des Lucioles - Sophia-Antipolis, France
  Graph Theory and Combinatorics group at Applied Mathematics IV Department of UPC - Barcelona, Spain
Algorithms and Computation•December 2007, pp 561-573• https://doi.org/10.1007/978-3-540-77120-3_49
Abstract
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
- Júlio Araújo
  Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Marin Bougeret
  LIRMM, CNRS, Université de Montpellier, Montpellier, France
  ,
- Victor Campos
  Departamento de Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ignasi Sau
  LIRMM, CNRS, Université de Montpellier, Montpellier, France
Algorithmica, Volume 84, Issue 11•Nov 2022, pp 3365-3406 • https://doi.org/10.1007/s00453-022-00979-z
Abstract
In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph G and a positive integer k, and the objective is to decide whether G contains a minimal vertex cover of size at least k. Motivated by the kernelization of MMVC with parameter ... $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Giannos Stamoulis
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Dimitrios M. Thilikos
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
ACM Transactions on Algorithms, Volume 18, Issue 3•July 2022, Article No.: 21, pp 1-30 • https://doi.org/10.1145/3519028
Let 𝒢 be a minor-closed graph class. We say that a graph G is a k-apex of 𝒢 if G contains a set S of at most k vertices such that G\S belongs to 𝒢. We denote by 𝒜_k (𝒢) the set of all graphs that are k-apices of 𝒢. In the first paper of this series, ...
6Citation
128
Downloads
Metrics
Total Citations6
Total Downloads128
Last 12 Months26
Last 6 weeks4
Export Citations
Save to Binder
Get Access
research-article
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
- Júlio Araújo
  Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Marin Bougeret
  CNRS, LIRMM, Université de Montpellier, Montpellier, France
  ,
- Victor A. Campos
  Departamento de Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ignasi Sau
  CNRS, LIRMM, Université de Montpellier, Montpellier, France
Algorithmica, Volume 85, Issue 2•Feb 2023, pp 444-491 • https://doi.org/10.1007/s00453-022-01036-5
Abstract
A blocking set in a graph G is a subset of vertices that intersects every maximum independent set of G. Let $mmbs (G)$ be the size of a maximum (inclusion-wise) minimal blocking set of G. This parameter has recently played an important role in the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
- Raul Lopes
  Departamento de Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  LIRMM, Université de Montpellier, Montpellier, France
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
Theoretical Computer Science, Volume 898, Issue C•Jan 2022, pp 75-91 • https://doi.org/10.1016/j.tcs.2021.10.023
Abstract
In the Directed Disjoint Paths problem, we are given a digraph D and a set of requests { ( s 1 , t 1 ) , … , ( s k , t k ) }, and the task is to find a collection of pairwise vertex-disjoint paths { P 1 , … , P k } such that each P i ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
SIAM Journal on Discrete Mathematics, Volume 36, Issue 4, pp 2737-2773 • https://doi.org/10.1137/21M1400766

We study the kernelization complexity of structural parameterizations of the Vertex Cover problem. Here, the goal is to find a polynomial-time preprocessing algorithm that can reduce any instance $(G,k)$ of the Vertex Cover problem to an equivalent one, ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Hitting forbidden induced subgraphs on bounded treewidth graphs
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Uéverton dos Santos Souza
  Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
Information and Computation, Volume 281, Issue C•Dec 2021 • https://doi.org/10.1016/j.ic.2021.104812
Abstract
For a fixed graph H, the H -IS-Deletion problem asks, given a graph G, for the minimum size of a set S ⊆ V ( G ) such that G ∖ S excludes H as an induced subgraph. We are interested in determining, for a fixed H, the ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
- Rémy Belmonte
  University of Electro-Communications, Chofu, Japan
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
Algorithmica, Volume 83, Issue 8•Aug 2021, pp 2351-2373 • https://doi.org/10.1007/s00453-021-00830-x
Abstract
We study the complexity of the problems of finding, given a graph G, a largest induced subgraph of G with all degrees odd (called an odd subgraph), and the smallest number of odd subgraphs that partition V(G). We call these parameters $mos (G)$ and $χ_{...}$ $_{}$ $^{}^{}$ $^{}^{}$ $_{}$
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
A unifying model for locally constrained spanning tree problems
- Luiz Viana
  Campus de Crateús, Universidade Federal do Ceará, Crateús, Brazil
  ,
- Manoel Campêlo
  Dep. de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Ana Silva
  Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil
Journal of Combinatorial Optimization, Volume 42, Issue 1•Jul 2021, pp 125-150 • https://doi.org/10.1007/s10878-021-00740-2
Abstract
Given a graph G and a digraph D whose vertices are the edges of G, we investigate the problem of finding a spanning tree of G that satisfies the constraints imposed by D. The restrictions to add an edge in the tree depend on its neighborhood in D. ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
- Guilherme C. M. Gomes
  Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
  LIRMM, Université de Montpellier, Montpellier, France
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
Algorithmica, Volume 83, Issue 6•Jun 2021, pp 1677-1706 • https://doi.org/10.1007/s00453-021-00798-8
Abstract
A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut. The Matching Cut problem asks whether a graph has a matching cut, and has been ... $^{} (^{})$
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Target set selection with maximum activation time
- Lucas Keiler
  Departamento de Computação, Centro de Ciencias, Universidade Federal do Ceará, Fortaleza - CE, CEP 60440-900, Brasil
  ,
- Carlos V.G.C. Lima
  Departamento de Computação, Centro de Ciencias, Universidade Federal do Ceará, Fortaleza - CE, CEP 60440-900, Brasil
  ,
- Ana Karolinna Maia
  Departamento de Computação, Centro de Ciencias, Universidade Federal do Ceará, Fortaleza - CE, CEP 60440-900, Brasil
  ,
- Rudini Sampaio
  Departamento de Computação, Centro de Ciencias, Universidade Federal do Ceará, Fortaleza - CE, CEP 60440-900, Brasil
  ,
- Ignasi Sau
  LIRMM, Universite de Montpellier, CNRS, Montpellier, France
Procedia Computer Science, Volume 195, Issue C•2021, pp 86-96 • https://doi.org/10.1016/j.procs.2021.11.014
Abstract
A target set selection model is a graph G with a threshold function τ : V(G) → N upper-bounded by the vertex degree. For a given model, a set S₀ ⊆ V(G) is a target set if V(G) can be partitioned into non-empty subsets S₀, S₁,....,S_t such that, for ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Dual Parameterization of Weighted Coloring
- Júlio Araújo
  Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Victor A. Campos
  Departamento de Computação, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Carlos Vinícius G. C. Lima
  Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
  ,
- Vinícius Fernandes dos Santos
  Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
  ,
- Ana Silva
  Departamento de Matemática, Universidade Federal do Ceará, Fortaleza, Brazil
Algorithmica, Volume 82, Issue 8•Aug 2020, pp 2316-2336 • https://doi.org/10.1007/s00453-020-00686-7
Abstract
Given a graph G, a properk-coloring of G is a partition $c = {(S_{i})}_{i \in [1, k]}$ of V(G) into k stable sets $S_{1}, \dots, S_{k}$ . Given a weight function $w : V (G) \to R^{+}$ , the weight of a color $S_{i}$ is defined as $w (i) = {max}_{v \in S_{i}} w (v)$ and the weight of a coloringc as $w (c) = \sum_{i = 1}^{k} w (i)$ . ... $^{}$ $_{}$ $^{}^{}$ $^{}^{}$ $^{}^{}$ $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
- Rémy Belmonte
  University of Electro-Communications, Chofu, Japan
  ,
- Ignasi Sau
  LIRMM, Université de Montpellier, CNRS, Montpellier, France
Graph-Theoretic Concepts in Computer Science•June 2020, pp 67-79• https://doi.org/10.1007/978-3-030-60440-0_6
Abstract
We study the complexity of the problems of finding, given a graph G, a largest induced subgraph of G with all degrees odd (called an odd subgraph), and the smallest number of odd subgraphs that partition V(G). We call these parameters $mos (G)$ and $χ_{...}$ $_{}$ $^{}^{}$ $^{}^{}$ $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
- Júlio Araújo
  Departamento de Matemática, ParGO Research Group, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Victor A. Campos
  Departamento de Computação, ParGO Research Group, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ana Karolinna Maia
  Departamento de Computação, ParGO Research Group, Universidade Federal do Ceará, Fortaleza, Brazil
  ,
- Ignasi Sau
  Departamento de Matemática, ParGO Research Group, Universidade Federal do Ceará, Fortaleza, Brazil
  CNRS, AlGCo Project Team, LIRMM, Université de Montpellier, Montpellier, France
  ,
- Ana Silva
  Departamento de Matemática, ParGO Research Group, Universidade Federal do Ceará, Fortaleza, Brazil
Algorithmica, Volume 82, Issue 6•Jun 2020, pp 1616-1639 • https://doi.org/10.1007/s00453-019-00659-5
Abstract
For two positive integers k and $ℓ$ , a $(k \times ℓ)$ -spindle is the union of k pairwise internally vertex-disjoint directed paths with $ℓ$ arcs each between two vertices u and v. We are interested in the (parameterized) complexity of several problems ...
0Citation
Metrics
Total Citations0
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

Ignasi Sau

Ignasi Sau

Applied Filters

People

Colleagues

Roles

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Redicolouring digraphs: Directed treewidth and cycle-degeneracy

Compound Logics for Modification Problems

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

Target set selection with maximum activation time

Reducing the vertex cover number via edge contractions

k-apices of minor-closed graph classes. I. Bounding the obstructions

Hardness and Approximation of Traffic Grooming

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Hitting forbidden induced subgraphs on bounded treewidth graphs

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings

A unifying model for locally constrained spanning tree problems

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

Target set selection with maximum activation time

Dual Parameterization of Weighted Coloring

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths