Información de la conferencia
IPEC 2024: International Symposium on Parameterized and Exact Computation
https://algo-conference.org/2024/ipec/Día de Entrega: |
2024-06-26 |
Fecha de Notificación: |
2024-08-05 |
Fecha de Conferencia: |
2024-09-04 |
Ubicación: |
Egham, UK |
Años: |
19 |
QUALIS: b2 Vistas: 17860 Seguidores: 2 Asistentes: 0
Solicitud de Artículos
Scope The International Symposium on Parameterized and Exact Computation (IPEC) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 19th edition will be part of ALGO 2024, which also hosts ESA 2024 and other specialized conferences and workshops. Accepted papers Jonas Lill, Kalina Petrova, and Simon Weber: Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, and Amer Mouawad: Parameterized Shortest Path Reconfiguration Jakub Balabán, Robert Ganian, and Mathis Rocton: Twin-Width Meets Feedback Edges and Vertex Integrity Peter Strulo, M. S. Ramanujan, Václav Blažej, and Sushmita Gupta: On Controlling Knockout Tournaments Without Perfect Information Ishay Haviv and Dror Rabinovich: Kernelization for Orthogonality Dimension Peter Strulo, Václav Blažej, M. S. Ramanujan, and Satyabrata Jana: On the Parameterized Complexity of Eulerian Strong Component Deletion Marvin Künnemann and Mirza Redzic: Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis: Parameterised distance to local irregularity Matthias Kaul, Matthias Mnich, and Hendrik Molter: Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates Tomohiro Koana, Nidhi Purohit, and Kirill Simonov: Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, and Ziena Zeif: Combining Crown Structures for Vulnerability Measures Yuxi Liu and Mingyu Xiao: Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k Carla Groenland, Jesper Nederlof, and Tomohiro Koana: A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond: Kick the cliques Paul Bastide and Carla Groenland: Quasi-linear distance query reconstruction for graphs of bounded treelength Ilan Doron-Arad, Ariel Kulik and Fabrizio Grandoni: Unsplittable Flow on a Short Path Matthias Bentert, Fedor V. Fomin, Fanny Hauser, and Saket Saurabh: The Parameterized Complexity Landscape of Two-Sets Cut-Uncut Jakob Greilhuber and Roohani Sharma: Component Order Connectivity admits no polynomial kernel parameterized by the feedback vertex set number Anna Zych-Pawlewicz and Marek Żochowski: Dynamic Parameterized Feedback Problems in Tournaments Henning Fernau and Kevin Mann: Roman Hitting Functions Karthik C. S., Euiwoong Lee, and Pasin Manurangsi: On Equivalence of Parameterized Inapproximability of k-median, k-max-coverage, and 2-CSP Guilherme de Castro Mendes Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos: Matching (Multi)Cut: Algorithms, Complexity, and Enumeration Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F.A. Verhaegh: Preprocessing to Reduce the Search Space for Odd Cycle Transversal Jaroslav Garvardt and Christian Komusiewicz: Modularity Clustering parameterized by Max Leaf Number Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh: Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset
Última Actualización Por Dou Sun en 2024-10-01
Coeficiente de Aceptación
Año | Enviados | Aceptados | Aceptados(%) |
---|---|---|---|
2020 | 53 | 26 | 49.1% |
2019 | 40 | 24 | 60% |
2018 | 48 | 24 | 50% |
2017 | 68 | 29 | 42.6% |
2016 | 48 | 28 | 58.3% |
2015 | 51 | 32 | 62.7% |
2014 | 42 | 27 | 64.3% |
2013 | 58 | 29 | 50% |
2012 | 37 | 21 | 56.8% |
2011 | 40 | 21 | 52.5% |
2010 | 32 | 19 | 59.4% |
2009 | 52 | 25 | 48.1% |
2008 | 32 | 17 | 53.1% |
2004 | 47 | 25 | 53.2% |
Conferencias Relacionadas
Revistas Relacionadas
CCF | Nombre Completo | Factor de Impacto | Editor | ISSN |
---|---|---|---|---|
Journal of Documentation | 1.700 | Emerald | 0022-0418 | |
Interaction Studies | 0.900 | John Benjamins Publishing Company | 1572-0373 | |
International Journal of Applied Mathematics and Computer Science | 1.600 | Walter de Gruyter | 1641-876X | |
International Journal of E-Entrepreneurship and Innovation | IGI Global | 1947-8585 | ||
b | Data & Knowledge Engineering | 2.700 | Elsevier | 0169-023X |
b | IEEE Transaction on Wireless Communications | 8.900 | IEEE | 1536-1276 |
International Journal of Intelligent Computing and Cybernetics | Emerald | 1756-378X | ||
c | Journal of Network and Computer Applications | 7.700 | Elsevier | 1084-8045 |
International Journal of Advances in Intelligent Informatics | Universitas Ahmad Dahlan | 2442-6571 | ||
Mathematics and Computers in Simulation | 4.400 | Elsevier | 0378-4754 |
Nombre Completo | Factor de Impacto | Editor |
---|---|---|
Journal of Documentation | 1.700 | Emerald |
Interaction Studies | 0.900 | John Benjamins Publishing Company |
International Journal of Applied Mathematics and Computer Science | 1.600 | Walter de Gruyter |
International Journal of E-Entrepreneurship and Innovation | IGI Global | |
Data & Knowledge Engineering | 2.700 | Elsevier |
IEEE Transaction on Wireless Communications | 8.900 | IEEE |
International Journal of Intelligent Computing and Cybernetics | Emerald | |
Journal of Network and Computer Applications | 7.700 | Elsevier |
International Journal of Advances in Intelligent Informatics | Universitas Ahmad Dahlan | |
Mathematics and Computers in Simulation | 4.400 | Elsevier |
Recomendaciones