A new stochastic load balancing model is introduced that allows for a tradeoff between non-adaptive policies and performance, with results showing a 2-reservation approximation to the omniscient optim…

This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

The paper re-examines the Parking Permit Problem using the primal-dual scheme, obtaining simple algorithms with superior performance guarantees and providing near-matching lower bounds.

The Cologne Information Retrieval group participated in iKAT SCAI 2026 shared task using an agentic conversational search system with query rewriting, retrieval, reranking, answer generation, and clar…

The study demonstrates that LLMs exhibit significant, language-driven disparities in medical triage recommendations, recommending emergency care more frequently for English and Arabic prompts, even wh…

This paper proves a new lower bound of $ ildeΩ(n^2)$ for read-once parity branching programs on boolean functions, improving upon the previous bound of $ ildeΩ(n^{1.5})$.

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

This paper introduces AI Tour Meeting, a group travel planning framework utilizing multiple Large Language Model (LLM) agents with distinct personas for collaborative itinerary planning.

This paper proves that every simple planar graph with no copy of C8 has at most 69/25(n-2) edges, improving the previous bound.

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…

The paper introduces Hyperparam, a set of lightweight JavaScript libraries designed to enable direct, model-aware querying of unstructured data (like agent traces) within client-side AI applications.