362 results on '"Artur Czumaj"'
Search Results
52. Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
53. Small Space Representations for Metric Min-Sum k -Clustering and Their Applications.
54. Testing Expansion in Bounded-Degree Graphs.
55. Efficient Kinetic Data Structures for MaxCut.
56. Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks.
57. Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.
58. Finding a heaviest triangle is not harder than matrix multiplication.
59. On testable properties in bounded degree graphs.
60. Facility Location in Sublinear Time.
61. Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
62. Sublinear-Time Approximation for Clustering Via Random Sampling.
63. Estimating the weight of metric minimum spanning trees in sublinear-time.
64. On the expected payment of mechanisms for task allocation.
65. Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
66. Computing equilibria for congestion games with (im)perfect information.
67. Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract).
68. Broadcasting Algorithms in Radio Networks with Unknown Topology.
69. Fault-tolerant geometric spanners.
70. Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.
71. Perfectly Balanced Allocation.
72. Sublinear-time approximation of Euclidean minimum spanning tree.
73. Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
74. Abstract Combinatorial Programs and Efficient Property Testers.
75. Selfish traffic allocation for server farms.
76. Tight bounds for worst-case equilibria.
77. Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
78. Testing Hypergraph Coloring.
79. Property Testing with Geometric Queries.
80. Soft kinetic data structures.
81. Front Matter, Table of Contents, Preface, Conference Organization
82. LIPIcs, Volume 227, SWAT 2022, Complete Volume
83. Near-Shortest Path Routing in Hybrid Communication Networks
84. Fast Approximation Schemes for Euclidean Multi-connectivity Problems.
85. Balanced allocations: the heavily loaded case.
86. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract).
87. On the Complexity of Determining the Period of a String.
88. Property Testing in Computational Geometry.
89. Infinite parallel job allocation (extended abstract).
90. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma.
91. Efficient Web Searching Using Temporal Factors.
92. Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
93. On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem.
94. On parallel time in population protocols
95. A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity.
96. Recovery Time of Dynamic Allocation Processes.
97. Randomized Allocation Processes.
98. Routing on the PADAM: Degrees of Optimality.
99. Bounded Degree Spanning Trees (Extended Abstract).
100. The Architecture of a Software Library for String Processing.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.