Cslovjecsek, Jana

1. Parameterized algorithms for block-structured integer programs with large entries
   2023/11/03 by Jana Cslovjecsek, Cslovjecsek, Jana, Martin Koutecký +7 · 2 citations
   Business, Management and Accounting · Economics, Econometrics and Finance · Engineering · #Data Structures and Algorithms (cs.DS) #Economic theories and models #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Scheduling and Optimization Algorithms #Supply Chain and Inventory Management
2. Independence number of intersection graphs of axis-parallel segments
   2022/05/30 by Caoduro, Marco, Cslovjecsek, Jana, Pilipczuk, Michał +1 · 1 citation
   #05B40 #52C15 #68W25 #90C27 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
3. Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
   2020/12/21 by Cslovjecsek, Jana, Eisenbrand, Friedrich, Pilipczuk, Michał +2 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
4. A polynomial-time OPT^ε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph
   2023/10/31 by Jana Cslovjecsek, Cslovjecsek, Jana, Michał Pilipczuk +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems