[et_pb_section fb_built=”1″ _builder_version=”4.20.0″ custom_padding=”||2px|||” top_divider_style=”wave2″ top_divider_color=”#5390c1″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][et_pb_divider color=”#e09900″ _builder_version=”4.16″ global_colors_info=”{}”][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.20.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.20.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
Exact and Approximate High-Multiplicity Scheduling on Identical Machines <\/strong> Unit refutations in Horn constraint systems <\/strong> On Exact Learning of $d$-Monotone Functions <\/strong> Computational Complexity of Combinatorial Distance Matrix Realisation <\/strong> Online Range Assignment Problems <\/strong> General Position Subset Selection in Line Arrangements <\/strong> Branching Programs with Extended Memory: New Insights <\/strong> Tatami Printer: Physical ZKPs for Tatami Puzzles <\/strong> On the Price of Anarchy in Packet Routing Games with FIFO <\/strong> On the Computational Complexity of Graph Reconstruction <\/strong> Efficient Certifying Algorithms for Linear Classification <\/strong> Improved Sublinear-time Moment Estimation using Weighted Sampling <\/strong> On the Structural Parameterizations of Locating-Dominating Set and Test Cover <\/strong> Improved bounds for group testing in arbitrary hypergraphs <\/strong> A Parameterized Perspective of All-Colors <\/strong> On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane <\/strong> Degree Realization by Bipartite Cactus Graphs <\/strong> On Two Simple[st] Learning Tasks <\/strong> Dynamic Filter and Retrieval with One Access to Modifiable Memory <\/strong> Longest path transversals in claw-free and $P_5$-free graphs <\/strong> Realizing Graphs with Cut Constraints <\/strong> On The Computational Complexity of Games with Uncertainty <\/strong> Happy set problems on cubic graphs and convex bipartite graphs <\/strong> Network Creation Games with 2-Neighborhood Maximization <\/strong> Almost-catalytic Computation <\/strong> The Complexity of Landmark Hub Labeling <\/strong> Improved Bounds for Geodetic Hulls <\/strong> Disjoint Temporal Walks Under Waiting Time Constraints <\/strong> A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering <\/strong> Bounded degree QBF and positional games <\/strong> Subsequence Matching and LCS with Segment Number Constraints <\/strong> Fast Geographic Routing in Fixed-Growth Graphs <\/strong> Arithmetic Circuits with Division <\/strong> Pinwheel Covering <\/strong> On the Hardness of the Drone Delivery Problem <\/strong> Nonpartisan Feedback Vertex Set <\/strong> Parameterized Complexity of Disconnected Matchings <\/strong> Burning Path-like and Clique-like Graphs <\/strong> Online Bichromatic Piercing Set Problem <\/strong> Packing dimers to maximum occupancy under soft-core constraints <\/strong> Atoms versus Avoiding Simplicial Vertices <\/strong> Supereulerian Testing on Semi-Eulerian Graphs <\/strong> Perpetual Scheduling with Explorable Uncertainty <\/strong> Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement <\/strong> [\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":" Accepted PapersExact and Approximate High-Multiplicity Scheduling on Identical Machines Klaus Jansen, Kai Kahler and Esther Zwanger Unit refutations in Horn constraint systems Piotr Wojciechowski and K. Subramani. On Exact Learning of $d$-Monotone Functions Nader Bshouty. Computational Complexity of Combinatorial Distance Matrix Realisation David Fairbairn, George Mertzios and Norbert Peyerimhoff. Online Range Assignment Problems Paz Carmi, […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-361","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/361"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/comments?post=361"}],"version-history":[{"count":11,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/361\/revisions"}],"predecessor-version":[{"id":243816,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/361\/revisions\/243816"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/media?parent=361"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Klaus Jansen, Kai Kahler and Esther Zwanger<\/p>\n
Piotr Wojciechowski and K. Subramani.<\/p>\n
Nader Bshouty.<\/p>\n
David Fairbairn, George Mertzios and Norbert Peyerimhoff.<\/p>\n
Paz Carmi, Matthew Katz and Idan Tomer.<\/p>\n
Adrian Dumitrescu.<\/p>\n
Suryajith Chillara and Nithish Raja.<\/p>\n
Suthee Ruangwises.<\/p>\n
Daniel Schmand, Torben Sch\u00fcrenberg and Martin Strehler.<\/p>\n
Cristina Bazgan, Morgan Chopin, Andr\u00e9 Nichterlein and Camille Richer.<\/p>\n
Vincenzo Bonifaci and Sara Galatro.<\/p>\n
Anup Bhattacharya and Pinki Pradhan.<\/p>\n
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale.<\/p>\n
Annalisa De Bonis.<\/p>\n
Peter Strulo, V\u00e1clav Bla\u017eej and Satyabrata Jana.<\/p>\n
Leonidas Palios.<\/p>\n
Amotz Bar-Noy, Toni B\u00f6hnlein, David Peleg, Yingli Ran and Dror Rawitz.<\/p>\n
Omrit Filtser, Kien Huynh, Anastasia Lemetti, Joseph Mitchell, Tatiana Polishchuk and Valentin Polishchuk.<\/p>\n
Ioana Bercea, Guy Even, Tomer Even and Gabriel Marques Domingues.<\/p>\n
Paloma Lima and Amir Nikabadi.<\/p>\n
Lucas de Oliveira Silva, V\u00edtor Gomes Chagas, Samuel Pla\u00e7a de Paula, Greis Yvet Oropeza Quesqu\u00e9n and U\u00e9verton dos Santos Souza.<\/p>\n
Bruce M. Kapron and Koosha Samieefar.<\/p>\n
Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano and Yudai Oka.<\/p>\n
Merlin de la Haye, Pascal Lenzner, Daniel Schmand and Nicole Schr\u00f6der.<\/p>\n
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai and Jayalal Sarma.<\/p>\n
Louann Coste, Ruoying Li, Sabine Storandt and Tobias T\u00f6pfer.<\/p>\n
Gregor Diatzko, Sabine Storandt and Tobias T\u00f6pfer.<\/p>\n
Allen Ibiapina, Raul Lopes, Andrea Marino and Ana Silva.<\/p>\n
Kensuke Oowa, Peter Fulla and Takuro Fukunaga.<\/p>\n
Nacim Oijid.<\/p>\n
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka and Ayumi Shinohara.<\/p>\n
Ofek Gila, Michael Goodrich, Abraham Illickan and Vinesh Sridhar.<\/p>\n
Silas Cato Sacher.<\/p>\n
Akitoshi Kawamura, Yusuke Kobayashi and Yosuke Kusano.<\/p>\n
Simon Bartlmae, Andreas Hene and Kelin Luo.<\/p>\n
Nidhi Purohit, Souvik Saha, Saket Saurabh and Anannya Upasana.<\/p>\n
Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak and Saket Saurabh.<\/p>\n
Radhika Aggarwal, Pradeesha Ashok and Dhairya Gupta.<\/p>\n
Minati De and Ratnadip Mandal.<\/p>\n
Robert Barish and Tetsuo Shibuya.<\/p>\n
Karl Boddy, Konrad K. Dabrowski and Daniel Paulusma.<\/p>\n
Wing-Kai Hon, Meng-Tsung Tsai and Ching-Yu Yang.<\/p>\n
William Evans and Seyed Ali Tabatabaee.<\/p>\n
Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh and Sanjukta Roy.<\/p>\n