Found 622 Documents (Results 1–100)
On star partition of split graphs. (English) Zbl 07857798
Kalyanasundaram, Subrahmanyam (ed.) et al., Algorithms and discrete applied mathematics. 10th international conference, CALDAM 2024, Bhilai, India, February 15–17, 2024. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14508, 209-223 (2024).
Tractability of approximation by general shallow networks. (English) Zbl 1537.41017
Reviewer: Martin D. Buhmann (Gießen)
Computational complexity of normalizing constants for the product of determinantal point processes. (English) Zbl 1541.68157
Orienting undirected phylogenetic networks. (English) Zbl 07783114
MSC:
68-XX
On the width of complicated JSJ decompositions. (English) Zbl 07927899
Chambers, Erin W. (ed.) et al., 39th international symposium on computational geometry, SoCG 2023, Dallas, Texas, USA, June 12–15, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 258, Article 42, 18 p. (2023).
MSC:
68U05
Fixed-parameter algorithms for computing RAC drawings of graphs. (English) Zbl 07925711
Bekos, Michael A. (ed.) et al., Graph drawing and network visualization. 31st international symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023. Revised selected papers. Part II. Cham: Springer. Lect. Notes Comput. Sci. 14466, 66-81 (2023).
Buy and hold golden strategies in financial markets with frictions and depth constraints. (English) Zbl 07878240
Tree drawings with columns. (English) Zbl 07869504
Bekos, Michael A. (ed.) et al., Graph drawing and network visualization. 31st international symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023. Revised selected papers. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14465, 195-210 (2023).
Minimizing an uncrossed collection of drawings. (English) Zbl 07869498
Bekos, Michael A. (ed.) et al., Graph drawing and network visualization. 31st international symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023. Revised selected papers. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14465, 110-123 (2023).
On the complexity of the \(k\)-independence number and the \(h\)-diameter of a graph. (English) Zbl 07853385
Paths and connectivity in temporal graphs. Textbook for a mini course at the 34th Brazilian mathematics colloquium – 34°Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2023. (English) Zbl 1535.05003
Publicações Matemáticas do IMPA. Rio de Janeiro: Instituto Nacional de Matemática Pura e Aplicada (IMPA) (ISBN 978-85-244-0541-9/print; 978-85-244-0536-5/ebook). 64 p., open access (2023).
An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium – 34°Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil. (Uma introdução à convexidade em grafos.) (Portuguese) Zbl 1539.05003
Publicações Matemáticas do IMPA. Rio de Janeiro: Instituto Nacional de Matemática Pura e Aplicada (IMPA) (ISBN 978-85-244-0547-1/print; 978-85-244-0545-7/ebook). 158 p., open access (2023).
The parameterized complexity of \(s\)-club with triangle and seed constraints. (English) Zbl 1525.05034
An FPT algorithm for bipartite vertex splitting. (English) Zbl 07727766
Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 261-268 (2023).
Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness. (English) Zbl 1515.65068
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. (English) Zbl 1506.68188
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times. (English) Zbl 1529.68060
Simple Combinatorial Construction of the \(k^{o(1)}\)-Lower Bound for Approximating the Parameterized \(k\)-Clique. arXiv:2304.07516
Preprint, arXiv:2304.07516 [cs.CC] (2023).
On the parallel parameterized complexity of MaxSAT variants. (English) Zbl 07880740
Meel, Kuldeep S. (ed.) et al., 25th international conference on theory and applications of satisfiability testing, SAT 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 236, Article 19, 19 p. (2022).
EC-tractability of multivariate approximation in Hermite spaces for the standard information class. (English) Zbl 1511.41013
Defensive alliances in graphs. (English) Zbl 1537.68136
Computing the best-case energy complexity of satisfying assignments in monotone circuits. (English) Zbl 1537.68036
Uniform error estimates for artificial neural network approximations for heat equations. (English) Zbl 1502.65171
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. (English) Zbl 1490.68123
On the complexity of and solutions to the minimum stopping and trapping set problems. (English) Zbl 1535.90177
Multistage vertex cover. (English) Zbl 07523542
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity. (English) Zbl 1537.68134
Parameterised complexity of model checking and satisfiability in propositional dependence logic. (English) Zbl 1534.68108
The complexity of finding temporal separators under waiting time constraints. (English) Zbl 1533.68261
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. (English) Zbl 1478.68219
An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes. (English) Zbl 07740887
Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 32, 17 p. (2021).
MSC:
68Wxx
On structural parameterizations of Node Kayles. (English) Zbl 07670961
Akiyama, Jin (ed.) et al., Discrete and computational geometry, graphs, and games. 21st Japanese conference, JCDCGGG 2018, Quezon City, Philippines, September 1–3, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13034, 96-105 (2021).
Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case. (English) Zbl 1498.68107
Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 380-391 (2021).
Sublinear-time reductions for big data computing. (English) Zbl 07550538
Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 374-388 (2021).
Sorting by multi-cut rearrangements. (English) Zbl 1490.68303
Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 593-607 (2021).
Balanced independent and dominating sets on colored interval graphs. (English) Zbl 1490.68147
Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 89-103 (2021).
Conflict-free coloring: graphs of bounded clique width and intersection graphs. (English) Zbl 1537.68115
Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 92-106 (2021).
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. (English) Zbl 07475101
Parameterized approximation algorithms for bidirected Steiner network problems. (English) Zbl 07475091
On the burning number of \(p\)-caterpillars. (English) Zbl 1479.05339
Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 145-156 (2021).
Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms. (English) Zbl 1508.90025
Token sliding on split graphs. (English) Zbl 1517.68273
Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. (English) Zbl 1477.68210
Filter Results by …
Document Type
- Journal Articles (353)
- Collection Articles (261)
- Books (7)
- arXiv Preprints (1)
all
top 5
Author
- Niedermeier, Rolf (44)
- Saurabh, Saket (31)
- Komusiewicz, Christian (25)
- Lokshtanov, Daniel (21)
- Nichterlein, André (18)
- Marx, Dániel (17)
- Lampis, Michael (16)
- Sau, Ignasi (16)
- Zehavi, Meirav (16)
- Agrawal, Akanksha (15)
- Fomin, Fedor V. (15)
- Raman, Venkatesh (15)
- Sorge, Manuel (15)
- Ganian, Robert (14)
- Fellows, Michael Ralph (13)
- Fluschnik, Till (13)
- Guo, Jiong (12)
- Molter, Hendrik (12)
- Panolan, Fahad (12)
- Pilipczuk, Michał (11)
- Szeider, Stefan (11)
- Bulteau, Laurent (10)
- Fernau, Henning (10)
- Kolay, Sudeshna (10)
- Misra, Neeldhara (10)
- Bonnet, Edouard (9)
- Bredereck, Robert (9)
- Gutin, Gregory Z. (9)
- Hermelin, Danny (9)
- Kratsch, Stefan (9)
- Mitsou, Valia (9)
- Sikora, Florian (9)
- Cygan, Marek (8)
- Dondi, Riccardo (8)
- Eiben, Eduard (8)
- Feldmann, Andreas Emil (8)
- Hartung, Sepp (8)
- Jain, Pallavi (8)
- Knop, Dušan (8)
- Krithika, R. (8)
- Pilipczuk, Marcin L. (8)
- Roth, Marc (8)
- Živný, Stanislav (8)
- Belmonte, Rémy (7)
- Cabello, Sergio (7)
- Fertin, Guillaume (7)
- Froese, Vincent (7)
- Hanaka, Tesshu (7)
- Kanj, Iyad A. (7)
- Mouawad, Amer E. (7)
- Souza, Uéverton S. (7)
- Talmon, Nimrod (7)
- Thilikos, Dimitrios M. (7)
- van Bevern, René (7)
- Van Leeuwen, Erik Jan (7)
- Wahlström, Magnus (7)
- Woźniakowski, Henryk (7)
- Zschoche, Philipp (7)
- Bazgan, Cristina (6)
- Casel, Katrin (6)
- dos Santos Souza, Uéverton (6)
- Feng, Qilong (6)
- Gaspers, Serge (6)
- Golovach, Petr A. (6)
- Hüffner, Falk (6)
- Kim, Eun Jung (6)
- Manurangsi, Pasin (6)
- Miao, Dongjing (6)
- Novak, Erich (6)
- Ordyniak, Sebastian (6)
- Otachi, Yota (6)
- Protti, Fábio (6)
- Sahlot, Vibha (6)
- Schmitt, Johannes (6)
- Spreer, Jonathan (6)
- Wang, Jianxin (6)
- Watrigant, Rémi (6)
- Ashok, Pradeesha (5)
- Banik, Aritra (5)
- Baste, Julien (5)
- Bliznets, Ivan A. (5)
- Chitnis, Rajesh Hemant (5)
- Choudhary, Pratibha (5)
- Cooper, Martin C. (5)
- Dantas da Silva, Maise (5)
- Giannopoulos, Panos (5)
- Ito, Takehiro (5)
- Jones, Mark (5)
- Lafond, Manuel (5)
- Li, Jianzhong (5)
- Mnich, Matthias (5)
- Nishimura, Naomi (5)
- Rosamond, Frances A. (5)
- Silva, Ana Shirley (5)
- Suchý, Ondřej (5)
- Woltran, Stefan (5)
- Zhu, Binhai (5)
- Abu-Khzam, Faisal N. (4)
- Araújo, Júlio César Silva (4)
- Barbero, Florian (4)
- and 748 more Authors
all
top 5
Serial
- Theor. Comput. Sci. (58)
- Algorithmica (50)
- Inf. Process. Lett. (29)
- J. Comput. Syst. Sci. (24)
- ACM Trans. Algorithms (17)
- Discrete Appl. Math. (15)
- SIAM J. Discrete Math. (12)
- ACM Trans. Comput. Theory (12)
- Artif. Intell. (10)
- Theory Comput. Syst. (10)
- SIAM J. Comput. (9)
- Inf. Comput. (8)
- J. Complexity (6)
- Algorithms (Basel) (6)
- J. Artif. Intell. Res. (JAIR) (5)
- Comput. Geom. (4)
- Ann. Math. Artif. Intell. (4)
- Discrete Math. Theor. Comput. Sci. (4)
- ACM Trans. Comput. Log. (4)
- Networks (3)
- Oper. Res. Lett. (3)
- Eur. J. Oper. Res. (3)
- J. Discrete Algorithms (3)
- Discrete Optim. (3)
- EMS Tracts Math. (3)
- Discrete Math. (2)
- Ann. Pure Appl. Logic (2)
- Discrete Comput. Geom. (2)
- Ann. Oper. Res. (2)
- Int. J. Found. Comput. Sci. (2)
- Mat. Contemp. (2)
- J. ACM (2)
- Publ. Mat. IMPA (2)
- Classical Quantum Gravity (1)
- IMA J. Numer. Anal. (1)
- ACM Trans. Math. Softw. (1)
- Ann. Stat. (1)
- Appl. Math. Comput. (1)
- J. Comb. Theory, Ser. B (1)
- J. Math. Psychol. (1)
- SIAM J. Numer. Anal. (1)
- J. Algorithms (1)
- Probab. Math. Stat. (1)
- Optimization (1)
- J. Autom. Reasoning (1)
- Int. J. Approx. Reasoning (1)
- J. Log. Comput. (1)
- Math. Program. (1)
- J. Logic Lang. Inf. (1)
- Stat. Sin. (1)
- Appl. Math. Finance (1)
- Log. J. IGPL (1)
- J. Comb. Optim. (1)
- J. Sched. (1)
- J. Graph Algorithms Appl. (1)
- Data Min. Knowl. Discov. (1)
- Fundam. Inform. (1)
- Appl. Stoch. Models Bus. Ind. (1)
- Found. Comput. Math. (1)
- Quantum Inf. Process. (1)
- Anal. Appl., Singap. (1)
- Int. J. Wavelets Multiresolut. Inf. Process. (1)
- Lect. Notes Comput. Sci. (1)
- Optim. Lett. (1)
- J. Satisf. Boolean Model. Comput. (1)
- Discrete Math. Algorithms Appl. (1)
- RAIRO, Theor. Inform. Appl. (1)
- Computability (1)
- Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. (1)
- J. Sib. Fed. Univ., Math. Phys. (1)
- Prikl. Diskretn. Mat. (1)
all
top 3
Software
- GitHub (4)
- JBool (3)
- MiniSat (3)
- Regina (3)
- cliques (3)
- Algorithm 447 (2)
- ComputeTW (2)
- DIMACS (2)
- Gurobi (2)
- LibTW (2)
- OEIS (2)
- SPRSupertrees (2)
- UCI-ml (2)
- tutte_bhkk (2)
- tw-heuristic (2)
- ANDES (1)
- APT (1)
- ASPARTIX (1)
- AWS (1)
- Algorithm 97 (1)
- BerkMin (1)
- Datalog (1)
- Dendroscope (1)
- DiVinE (1)
- GYutsis (1)
- GenLouvain (1)
- HMDB (1)
- ISOLATE (1)
- LEDA (1)
- LOLIB (1)
- Library of Triangulations (1)
- Lparse (1)
- Ltur (1)
- MSCquartets (1)
- MSOAR (1)
- NESTOR (1)
- NetworkX (1)
- NuMVC (1)
- OSCAR (1)
- PESPLib (1)
- PicoSAT (1)
- Potassco (1)
- QNet (1)
- SANET (1)
- SageMath (1)
- Simplicial complex library (1)
- Smodels (1)
- SuLQ (1)
- SylvX (1)
- Traces (1)
- bliss (1)
- dynASP (1)
- lowerbounds-survey (1)
- nauty (1)
- rSPR (1)
- robustbase (1)
- simpcomp (1)
- soft-DTW (1)
- speedy_colorful_subtrees (1)
- t-SNE (1)
- tcp_package (1)
