default search action
Manuel Lafond
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j38]Manuel Lafond, Vincent Moulton:
Path partitions of phylogenetic networks. Theor. Comput. Sci. 1024: 114907 (2025) - 2024
- [j37]Alitzel López Sánchez, Manuel Lafond:
Predicting horizontal gene transfers with perfect transfer networks. Algorithms Mol. Biol. 19(1): 6 (2024) - [j36]Kaari Landry
, Olivier Tremblay Savard, Manuel Lafond
A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks. J. Comput. Biol. 31(4): 360-379 (2024) - [j35]Reza Kalhor, Guillaume Beslon, Manuel Lafond, Céline Scornavacca:
A Rigorous Framework to Classify the Postduplication Fate of Paralogous Genes. J. Comput. Biol. 31(9): 815-833 (2024) - [j34]Manuel Lafond
Improved kernelization and fixed-parameter algorithms for bicluster editing. J. Comb. Optim. 47(5): 90 (2024) - [c42]Alitzel López Sánchez, Manuel Lafond:
Galled Perfect Transfer Networks. RECOMB-CG 2024: 24-43 - [c41]Riccardo Dondi, Manuel Lafond:
On the Complexity of Temporal Arborescence Reconfiguration. SAND 2024: 10:1-10:15 - [c40]Bertrand Marchand, Nadia Tahiri, Olivier Tremblay Savard, Manuel Lafond:
Finding Maximum Common Contractions Between Phylogenetic Networks. WABI 2024: 16:1-16:24 - [c39]Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales, Manuel Lafond:
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. WABI 2024: 20:1-20:21 - [i35]Bertrand Marchand, Yoann Anselmetti, Manuel Lafond, Aïda Ouangraoua:
Median and Small Parsimony Problems on RNA trees. CoRR abs/2402.03455 (2024) - [i34]Bertrand Marchand, Nadia Tahiri
Finding Maximum Common Contractions Between Phylogenetic Networks. CoRR abs/2405.16713 (2024) - [i33]Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta:
k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. CoRR abs/2407.02412 (2024) - [i32]Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales, Manuel Lafond:
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. CoRR abs/2407.06367 (2024) - [i31]Manuel Lafond, Vincent Moulton:
Path Partitions of Phylogenetic Networks. CoRR abs/2408.06489 (2024) - [i30]Alitzel López Sánchez, Manuel Lafond:
Galled Perfect Transfer Networks. CoRR abs/2409.03935 (2024) - 2023
- [j33]Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. Algorithmica 85(4): 992-1028 (2023) - [j32]David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Relative timing information and orthology in evolutionary scenarios. Algorithms Mol. Biol. 18(1): 16 (2023) - [j31]Andres Pastrana-Cruz
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms. Parallel Comput. 116: 103024 (2023) - [j30]Manuel Lafond
Recognizing k-Leaf Powers in Polynomial Time, for Constant k. ACM Trans. Algorithms 19(4): 35:1-35:35 (2023) - [j29]Kaari Landry
Defining Phylogenetic Network Distances Using Cherry Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1654-1666 (2023) - [c38]Manuel Lafond
The Longest Subsequence-Repeated Subsequence Problem. COCOA (1) 2023: 446-458 - [c37]Riccardo Dondi, Manuel Lafond:
An FPT Algorithm for Temporal Graph Untangling. IPEC 2023: 12:1-12:16 - [c36]Manuel Lafond, Weidong Luo:
Preprocessing complexity for some graph problems parameterized by structural parameters. LAGOS 2023: 130-139 - [c35]Manuel Lafond, Weidong Luo:
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. MFCS 2023: 61:1-61:14 - [c34]Reza Kalhor, Guillaume Beslon, Manuel Lafond, Céline Scornavacca:
Classifying the Post-duplication Fate of Paralogous Genes. RECOMB-CG 2023: 1-18 - [c33]Manuel Lafond, Anne Bergeron, Krister M. Swenson:
Two Strikes Against the Phage Recombination Problem. RECOMB-CG 2023: 68-83 - [c32]Kaari Landry, Olivier Tremblay Savard, Manuel Lafond:
Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks. RECOMB-CG 2023: 179-195 - [i29]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu:
The Two-Squirrel Problem and Its Relatives. CoRR abs/2302.05937 (2023) - [i28]Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu:
The Longest Subsequence-Repeated Subsequence Problem. CoRR abs/2304.06862 (2023) - [i27]Kaari Landry, Olivier Tremblay Savard, Manuel Lafond:
Finding agreement cherry-reduced subnetworks in level-1 networks. CoRR abs/2305.00033 (2023) - [i26]Andres Pastrana-Cruz, Manuel Lafond:
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms. CoRR abs/2305.09117 (2023) - [i25]Manuel Lafond, Weidong Luo:
Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters. CoRR abs/2306.12655 (2023) - [i24]Riccardo Dondi, Manuel Lafond:
An FTP Algorithm for Temporal Graph Untangling. CoRR abs/2307.00786 (2023) - [i23]Manuel Lafond, Weidong Luo:
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. CoRR abs/2307.02021 (2023) - [i22]Alitzel López Sánchez, Manuel Lafond:
Predicting Horizontal Gene Transfers with Perfect Transfer Networks. CoRR abs/2312.02962 (2023) - 2022
- [j28]Manuel Lafond, Ben Seamone, Rezvan Sherkati:
Further results on Hendry's Conjecture. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j27]Manuel Lafond, Binhai Zhu, Peng Zou:
Computing the Tandem Duplication Distance is NP-Hard. SIAM J. Discret. Math. 36(1): 64-91 (2022) - [j26]Manuel Lafond:
Graph Algorithms and Graph Theory-Symmetry Special Issue. Symmetry 14(8): 1748 (2022) - [c31]Manuel Lafond:
How Brokers Can Optimally Abuse Traders. FUN 2022: 18:1-18:19 - [c30]Manuel Lafond, Adiesha Liyanage, Binhai Zhu, Peng Zou:
The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes. RECOMB-CG 2022: 105-123 - [c29]Manuel Lafond:
Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>. SODA 2022: 1384-1410 - [c28]Alitzel López Sánchez
Predicting Horizontal Gene Transfers with Perfect Transfer Networks. WABI 2022: 3:1-3:22 - [i21]David Schaller, Tom Hartmann, Manuel Lafond, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler:
Relative Timing Information and Orthology in Evolutionary Scenarios. CoRR abs/2212.02201 (2022) - 2021
- [j25]Yoann Anselmetti, Nadia El-Mabrouk, Manuel Lafond, Aïda Ouangraoua:
Gene tree and species tree reconciliation with endosymbiotic gene transfer. Bioinform. 37(Supplement): 120-132 (2021) - [j24]Annie Chateau, Tom Davot
Efficient assembly consensus algorithms for divergent contig sets. Comput. Biol. Chem. 93: 107516 (2021) - [j23]Alitzel López Sánchez
Colorful orthology clustering in bounded-degree similarity graphs. J. Bioinform. Comput. Biol. 19(6): 2140010:1-2140010:15 (2021) - [j22]Pierre Charbit
Edge clique covers in graphs with independence number two. J. Graph Theory 97(2): 324-339 (2021) - [j21]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-energy tradeoffs for evacuation by two robots in the wireless model. Theor. Comput. Sci. 852: 61-72 (2021) - [c27]Kaari Landry, Aivee Teodocio, Manuel Lafond, Olivier Tremblay Savard:
Novel Phylogenetic Network Distances Based on Cherry Picking. AlCoB 2021: 57-81 - [c26]Manuel Lafond, Binhai Zhu:
Permutation-Constrained Common String Partitions with Applications. SPIRE 2021: 47-60 - [i20]Manuel Lafond:
Recognizing k-leaf powers in polynomial time, for constant k. CoRR abs/2110.15421 (2021) - 2020
- [j20]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny
Weak Coverage of a Rectangular Barrier. Algorithmica 82(4): 721-746 (2020) - [j19]Aniket C. Mane, Manuel Lafond, Pedro Cipriano Feijão, Cédric Chauve:
The distance and median problems in the single-cut-or-join model with single-gene duplications. Algorithms Mol. Biol. 15(1): 8 (2020) - [j18]Mattéo Delabre
Evolution through segmental duplications and losses: a Super-Reconciliation approach. Algorithms Mol. Biol. 15(1): 12 (2020) - [j17]Manuel Lafond, Marc Hellmuth
Reconstruction of time-consistent species trees. Algorithms Mol. Biol. 15(1): 16 (2020) - [j16]Samuel Briand, Christophe Dessimoz
A generalized Robinson-Foulds distance for labeled trees. BMC Genom. 21(S-10) (2020) - [j15]Gennaro Cordasco
Whom to befriend to influence people. Theor. Comput. Sci. 810: 26-42 (2020) - [c25]Manuel Lafond:
Even Better Fixed-Parameter Algorithms for Bicluster Editing. COCOON 2020: 578-590 - [c24]Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. CPM 2020: 22:1-22:15 - [c23]Manuel Lafond, Binhai Zhu, Peng Zou:
The Tandem Duplication Distance Is NP-Hard. STACS 2020: 15:1-15:15 - [i19]Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. CoRR abs/2002.04778 (2020) - [i18]Garance Cordonnier, Manuel Lafond:
Comparing copy-number profiles under multi-copy amplifications and deletions. CoRR abs/2002.11271 (2020) - [i17]Manuel Lafond, Ben Seamone, Rezvan Sherkati:
Further results on Hendry's Conjecture. CoRR abs/2007.07464 (2020) - [i16]David Schaller
Indirect Identification of Horizontal Gene Transfer. CoRR abs/2012.08897 (2020)
2010 – 2019
- 2019
- [j14]Riccardo Dondi, Manuel Lafond
Reconciling multiple genes trees via segmental duplications and losses. Algorithms Mol. Biol. 14(1): 7:1-7:19 (2019) - [j13]Nina Luhmann
The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. IEEE ACM Trans. Comput. Biol. Bioinform. 16(4): 1364-1373 (2019) - [j12]Manuel Lafond
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. Theor. Comput. Sci. 760: 15-34 (2019) - [j11]Manuel Lafond
On the Weighted Quartet Consensus problem. Theor. Comput. Sci. 769: 1-17 (2019) - [c22]Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. FCT 2019: 243-257 - [c21]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Energy Consumption of Group Search on a Line. ICALP 2019: 137:1-137:15 - [c20]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model. SIROCCO 2019: 185-199 - [c19]Anne-Laure Ehresmann
Distributed Pattern Formation in a Ring. SIROCCO 2019: 215-229 - [i15]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Energy Consumption of Group Search on a Line. CoRR abs/1904.09714 (2019) - [i14]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model. CoRR abs/1905.06783 (2019) - [i13]Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Distributed Pattern Formation in a Ring. CoRR abs/1905.08856 (2019) - [i12]Manuel Lafond, Binhai Zhu, Peng Zou:
The Tandem Duplication Distance is NP-hard. CoRR abs/1906.05266 (2019) - [i11]Manuel Lafond, Marc Hellmuth:
Reconstruction of time-consistent species trees. CoRR abs/1910.13123 (2019) - 2018
- [j10]Manuel Lafond, Mona Meghdari Miardan, David Sankoff:
Accurate prediction of orthologs in the presence of divergence after duplication. Bioinform. 34(13): i366-i375 (2018) - [j9]Manuel Lafond
Gene Tree Construction and Correction Using SuperTree and Reconciliation. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1560-1570 (2018) - [c18]Huda Chuangpishit, Manuel Lafond, Lata Narayanan:
Editing Graphs to Satisfy Diversity Requirements. COCOA 2018: 154-168 - [c17]Manuel Lafond:
The complexity of speedrunning video games. FUN 2018: 27:1-27:19 - [c16]Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende
Satisfying Neighbor Preferences on a Circle. LATIN 2018: 727-740 - [c15]Aniket C. Mane, Manuel Lafond, Pedro Feijão, Cédric Chauve:
The Rooted SCJ Median with Single Gene Duplications. RECOMB-CG 2018: 28-48 - [c14]Mattéo Delabre
Reconstructing the History of Syntenies Through Super-Reconciliation. RECOMB-CG 2018: 179-195 - [c13]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. WABI 2018: 5:1-5:16 - [i10]Manuel Lafond, Nadia El-Mabrouk, Katharina T. Huber, Vincent Moulton:
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. CoRR abs/1803.05866 (2018) - [i9]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. CoRR abs/1806.03988 (2018) - 2017
- [j8]Riccardo Dondi, Manuel Lafond, Nadia El-Mabrouk:
Approximating the correction of weighted and unweighted orthology and paralogy relations. Algorithms Mol. Biol. 12(1): 4:1-4:15 (2017) - [j7]Esaie Kuitche, Manuel Lafond, Aïda Ouangraoua:
Reconstructing protein and gene phylogenies using reconciliation and soft-clustering. J. Bioinform. Comput. Biol. 15(6): 1740007:1-1740007:25 (2017) - [j6]Philippe Gambette
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8) (2017) - [c12]Stefan Dobrev, Evangelos Kranakis
Weak Coverage of a Rectangular Barrier. CIAC 2017: 196-208 - [c11]Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus Problem. CPM 2017: 28:1-28:18 - [c10]Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. SPAA 2017: 265-274 - [c9]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). SPIRE 2017: 129-143 - [c8]Manuel Lafond:
On Strongly Chordal Graphs That Are Not Leaf Powers. WG 2017: 386-398 - [i8]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CoRR abs/1701.07294 (2017) - [i7]Manuel Lafond:
On strongly chordal graph that are not leaf powers. CoRR abs/1703.08018 (2017) - [i6]Mark Jones, Manuel Lafond, Céline Scornavacca:
Consistency of orthology and paralogy constraints in the presence of gene transfers. CoRR abs/1705.01240 (2017) - [i5]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR abs/1705.05295 (2017) - 2016
- [j5]Manuel Lafond, Riccardo Dondi, Nadia El-Mabrouk:
The link between orthology relations and gene trees: a correction perspective. Algorithms Mol. Biol. 11: 4 (2016) - [c7]Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk:
Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. CPM 2016: 14:1-14:12 - [c6]Manuel Lafond, Lata Narayanan, Kangkang Wu:
Whom to Befriend to Influence People. SIROCCO 2016: 340-357 - [c5]Riccardo Dondi, Nadia El-Mabrouk, Manuel Lafond:
Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results. WABI 2016: 121-136 - [i4]Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus problem. CoRR abs/1610.00505 (2016) - [i3]Manuel Lafond, Cédric Chauve, Nadia El-Mabrouk, Aïda Ouangraoua:
Gene Tree Construction and Correction using SuperTree and Reconciliation. CoRR abs/1610.05068 (2016) - [i2]Gennaro Cordasco, Luisa Gargano, Manuel Lafond, Lata Narayanan, Adele A. Rescigno, Ugo Vaccaro, Kangkang Wu:
Whom to befriend to influence people. CoRR abs/1611.08687 (2016) - 2015
- [j4]Manuel Lafond, Aïda Ouangraoua, Nadia El-Mabrouk:
Reconstructing a SuperGeneTree minimizing reconciliation. BMC Bioinform. 16(S14): S4 (2015) - [j3]Manuel Lafond, Ben Seamone:
Hamiltonian Chordal Graphs are not Cycle Extendable. SIAM J. Discret. Math. 29(2): 877-887 (2015) - [c4]Manuel Lafond, Nadia El-Mabrouk:
Orthology Relation and Gene Tree Correction: Complexity Results. WABI 2015: 66-79 - 2014
- [j2]Manuel Lafond, Cédric Chauve
Polytomy refinement for the correction of dubious duplications in gene trees. Bioinform. 30(17): 519-526 (2014) - 2013
- [j1]Manuel Lafond, Magali Semeria, Krister M. Swenson, Eric Tannier, Nadia El-Mabrouk:
Gene tree correction guided by orthology. BMC Bioinform. 14(S-15): S5 (2013) - [c3]Esma Aïmeur, Manuel Lafond:
The Scourge of Internet Personal Data Collection. ARES 2013: 821-828 - [p1]Manuel Lafond, Krister M. Swenson, Nadia El-Mabrouk:
Error Detection and Correction of Gene Trees. Models and Algorithms for Genome Evolution 2013: 261-285 - [i1]Manuel Lafond, Ben Seamone:
Hamiltonian chordal graphs are not cycle extendible. CoRR abs/1311.5863 (2013) - 2012
- [c2]Manuel Lafond, Pierre-Olivier Brosseau, Esma Aïmeur:
Privacy invasion in business environments. PST 2012: 221-224 - [c1]Manuel Lafond, Krister M. Swenson, Nadia El-Mabrouk:
An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. WABI 2012: 106-122
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: