المؤلفون: Golovach, Petr A., Panolan, Fahad, Rai, Ashutosh

مصطلحات موضوعية: Computer science

العلاقة: Golovach, Petr A. and Panolan, Fahad and Rai, Ashutosh and et al, . (2022) Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. In: 17th International Computer Science Symposium in Russia, CSR 2022, 29 June 2022through 1 July 2022, Virtual, Online.

الإتاحة: https://doi.org/10.1007/978-3-031-09574-0_10Test
http://raiith.iith.ac.in/10959Test/

المؤلفون: Yevhen Artamonov, Iurii Golovach, Vitalii Zymovchenko

المصدر: Technology Audit and Production Reserves, Vol 4, Iss 2(60), Pp 45-50 (2021)

مصطلحات موضوعية: HF5001-6182, Multimedia, Computer science, E-learning (theory), load balancing, computer.software_genre, e-learning system, microservice architecture, T1-995, multivariate access, Business, monolithic architecture, computer, Technology (General)

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9333ffa5148bdca3476195194b584c71Test
https://doi.org/10.15587/2706-5448.2021.237760Test

المؤلفون: Fomin, Fedor V., Golovach, Petr A., Lokshtanov, Daniel, Panolan, Fahad

مصطلحات موضوعية: Computer science

وصف الملف: text

العلاقة: http://raiith.iith.ac.in/10507/1/ACM_Transactions.pdfTest; Fomin, Fedor V. and Golovach, Petr A. and Lokshtanov, Daniel and Panolan, Fahad and et al, . (2021) Multiplicative Parameterization Above a Guarantee. In: ACM Transactions on Computation Theory.

الإتاحة: https://doi.org/10.1145/3460956Test
http://raiith.iith.ac.in/10507Test/
http://raiith.iith.ac.in/10507/1/ACM_Transactions.pdfTest

المؤلفون: V. Bulgakov, V. Adamchuk, Je. Ignat'iev, Z. Ruzhylo, I. Golovach

المصدر: Visnyk agrarnoi nauky. 98:60-66

مصطلحات موضوعية: Clogging, Deflection (engineering), Computer science, Mechanical engineering, Separator (oil production), Angular velocity, Conveyor belt, Kinematics, Coil spring, Heap (data structure)

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::1302c85532f669f44f937ac698f9b948Test
https://doi.org/10.31073/agrovisnyk202007-08Test

المؤلفون: Fahad Panolan, Fedor V. Fomin, Petr A. Golovach

المصدر: Data Mining and Knowledge Discovery. 34:478-532

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Rank (linear algebra), Computer Networks and Communications, Matrix norm, Binary number, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Perspective (geometry), Polynomial kernel, 020204 information systems, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Applied mathematics, Data Structures and Algorithms (cs.DS), Logical matrix, Mathematics, 000 Computer science, knowledge, general works, Small number, Computer Science Applications, 010201 computation theory & mathematics, Computer Science, 020201 artificial intelligence & image processing, Computer Science - Discrete Mathematics, Information Systems

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3567700be583d1c69871508ea0c2fd1cTest
https://doi.org/10.1007/s10618-019-00669-5Test

المؤلفون: Miguel Romero Calvo, Emmanuel Oluwatobi Salawu, Panpan Xu, Zichen Wang, Steven Combs, Colby Wise, Sri Priya Ponnapalli, George Price, Ryan Brand, Peter M Clark, Nataliya Golovach

مصطلحات موضوعية: Structure (mathematical logic), Sequence, Property (programming), Computer science, business.industry, Deep learning, Stability (learning theory), Protein engineering, Machine learning, computer.software_genre, Leverage (statistics), Artificial intelligence, Language model, business, computer

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::d60bfa5f2e87f55f276d2eec80367324Test
https://doi.org/10.1101/2021.09.21.460852Test

المؤلفون: Fomin, F.V., Golovach, P.A., Panolan, Fahad, Simonov, K.

مصطلحات موضوعية: Computer science

العلاقة: Fomin, F.V. and Golovach, P.A. and Panolan, Fahad and Simonov, K. (2020) Low-rank binary matrix approximation in column-sum norm. In: 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th International Conference on Randomization and Computation, APPROX/RANDOM 2020, 17-19 August 2020, Virtual, Online.

الإتاحة: http://raiith.iith.ac.in/11226Test/

المؤلفون: Fedor V. Fomin, Jean-Florent Raymond, Petr A. Golovach

المساهمون: Department of Informatics [Bergen] (UiB), University of Bergen (UiB), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Institut für Softwaretechnik und Theoretische Informatik [EECS-TUB], Fakultät Elektrotechnik und Informatik [TUB], Technische Universität Berlin (TU)-Technische Universität Berlin (TU), Ecole Nationale Supérieure des Mines de St Etienne-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS)

المصدر: Algorithmica
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
26th Annual European Symposium on Algorithms (ESA 2018)
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩
Algorithmica, Springer Verlag, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩

مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, G.2.2, Clique (graph theory), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Combinatorics, I.1.2, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Time complexity, Complement (set theory), Mathematics, 05C62, 68R10, 05C85, 021103 operations research, 000 Computer science, knowledge, general works, Applied Mathematics, Intersection graph, Tree (graph theory), Computer Science Applications, 010201 computation theory & mathematics, Independent set, Computer Science, Interval (graph theory), 020201 artificial intelligence & image processing, Combinatorics (math.CO), Computer Science - Discrete Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b56597e0049b899e10fd9540e11ab95bTest
https://hal.uca.fr/hal-03449925Test

المؤلفون: Fomin, Fedor V, Golovach, Petr A, Joshi, Saurabh

مصطلحات موضوعية: Computer science

العلاقة: Fomin, Fedor V and Golovach, Petr A and Joshi, Saurabh and et al, . (2019) Going far from degeneracy. In: 27th Annual European Symposium on Algorithms, ESA, 9-11 September 2019, Munich/Garching, Germany.

الإتاحة: https://doi.org/10.4230/LIPIcs.ESA.2019.47Test
http://raiith.iith.ac.in/7054Test/

المؤلفون: Fomin, Fedor V, Golovach, Petr A., Panolan, Fahad, Lokshtanov, Daniel, Saurabh, Saket, Zehavi, Meirav

مصطلحات موضوعية: Computer science

العلاقة: Fomin, Fedor V and Golovach, Petr A. and Panolan, Fahad and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav (2020) Going far from degeneracy. SIAM Journal on Discrete Mathematics, 34 (3). 1587 -1601. ISSN 0895-4801

الإتاحة: https://doi.org/10.1137/19M1290577Test
http://raiith.iith.ac.in/11182Test/
https://v2.sherpa.ac.uk/id/publication/32200Test