Improved bounds for the conflict-free chromatic art gallery problem. - Andreas Bärtschi; Subir Kumar Ghosh; Matús Mihalák; Thomas Tschager; Peter Widmayer (SoCG, 2014)

Conflict-Free Chromatic Art Gallery Coverage. - Andreas Bärtschi; Subhash Suri (Algorithmica, 2014)

Erratum to: Conflict-Free Chromatic Art Gallery Coverage. - Andreas Bärtschi; Subhash Suri (Algorithmica, 2014)

On Conflict-Free Multi-coloring. - Andreas Bärtschi; Fabrizio Grandoni 001 (WADS, 2015)

On Computing the Total Displacement Number via Weighted Motzkin Paths. - Andreas Bärtschi; Barbara Geissmann; Daniel Graf 001; Tomas Hruz; Paolo Penna; Thomas Tschager (IWOCA, 2016)

Truthful Mechanisms for Delivery with Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (ATMOS, 2017)

Energy-Efficient Fast Delivery by Mobile Agents. - Andreas Bärtschi; Thomas Tschager (FCT, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Truthful Mechanisms for Delivery with Mobile Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (CoRR, 2017)

Collective Fast Delivery by Energy-Efficient Agents. - Andreas Bärtschi; Daniel Graf 001; Matús Mihalák (MFCS, 2018)

Deterministic Preparation of Dicke States. - Andreas Bärtschi; Stephan J. Eidenbenz (FCT, 2019)

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. - Andreas Bärtschi; Stephan J. Eidenbenz (QCE, 2020)

The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover. - Jeremy Cook; Stephan J. Eidenbenz; Andreas Bärtschi (QCE, 2020)

Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. - Stefanie Zbinden; Andreas Bärtschi; Hristo N. Djidjev; Stephan J. Eidenbenz (ISC, 2020)

Collaborative delivery with energy-constrained mobile robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2020)

Threshold-Based Quantum Optimization. - John K. Golden; Andreas Bärtschi; Daniel O'Malley; Stephan J. Eidenbenz (QCE, 2021)

Sampling on NISQ Devices: "Who's the Fairest One of All?". - Elijah Pelofske; John K. Golden; Andreas Bärtschi; Daniel O'Malley; Stephan J. Eidenbenz (QCE, 2021)

QAOA-based Fair Sampling on NISQ Devices. - John K. Golden; Andreas Bärtschi; Daniel O'Malley; Stephan J. Eidenbenz (CoRR, 2021)

A Divide-and-Conquer Approach to Dicke State Preparation. - Shamminuj Aktar; Andreas Bärtschi; Abdel-Hameed A. Badawy; Stephan J. Eidenbenz (CoRR, 2021)

Near-gathering of energy-constrained mobile agents. - Andreas Bärtschi; Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Christina Karousatou; Matús Mihalák (Theor. Comput. Sci., 2021)

Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. - Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz (ICRC, 2022)

Short-Depth Circuits for Dicke State Preparation. - Andreas Bärtschi; Stephan J. Eidenbenz (QCE, 2022)

Quantum Telecloning on NISQ Computers. - Elijah Pelofske; Andreas Bärtschi; Bryan Garcia; Boris Kiefer; Stephan J. Eidenbenz (QCE, 2022)

Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search. - John K. Golden; Andreas Bärtschi; Stephan J. Eidenbenz; Daniel O'Malley (CoRR, 2022)

Quantum Volume in Practice: What Users Can Expect from NISQ Devices. - Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz (CoRR, 2022)

Scalable Experimental Bounds for Entangled Quantum State Fidelities. - Shamminuj Aktar; Andreas Bärtschi; Abdel-Hameed A. Badawy; Stephan J. Eidenbenz (CoRR, 2022)

Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset. - Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz (IEEE DataPort, 2022)

Scalable Experimental Bounds for Dicke and GHZ States Fidelities. - Shamminuj Aktar; Abdel-Hameed A. Badawy; Andreas Bärtschi; Stephan J. Eidenbenz (CF, 2023)

Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network. - Shamminuj Aktar; Andreas Bärtschi; Abdel-Hameed A. Badawy; Diane Oyen; Stephan J. Eidenbenz (QCE, 2023)

The Quantum Alternating Operator Ansatz for Satisfiability Problems. - John K. Golden; Andreas Bärtschi; Daniel O'Malley; Stephan J. Eidenbenz (QCE, 2023)

Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization. - John K. Golden; Andreas Bärtschi; Daniel O'Malley; Stephan J. Eidenbenz (QCE, 2023)

High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices. - Elijah Pelofske; Andreas Bärtschi; John K. Golden; Stephan J. Eidenbenz (QCE, 2023)

JuliQAOA: Fast, Flexible QAOA Simulation. - John K. Golden; Andreas Bärtschi; Dan O'Malley; Elijah Pelofske; Stephan J. Eidenbenz (SC Workshops, 2023)

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. - Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz (ISC, 2023)

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation. - Elijah Pelofske; Vincent Russo; Ryan LaRose; Andrea Mari; Dan Strano; Andreas Bärtschi; Stephan J. Eidenbenz; William J. Zeng (CoRR, 2023)

Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios. - Naphan Benchasattabuse; Andreas Bärtschi; Luis Pedro García-Pintos; John K. Golden; Nathan Lemons; Stephan J. Eidenbenz (CoRR, 2023)

Probing Quantum Telecloning on Superconducting Quantum Processors. - Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz; Bryan Garcia; Boris Kiefer (CoRR, 2023)

Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs. - Elijah Pelofske; Andreas Bärtschi; Lukasz Cincio; John K. Golden; Stephan J. Eidenbenz (CoRR, 2023)

Trainability Barriers in Low-Depth QAOA Landscapes. - Joel Rajakumar; John K. Golden; Andreas Bärtschi; Stephan J. Eidenbenz (CF, 2024)

Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation. - Shamminuj Aktar; Andreas Bärtschi; Diane Oyen; Stephan J. Eidenbenz; Abdel-Hameed A. Badawy (QCE, 2024)

Hierarchical Multigrid Ansatz for Variational Quantum Algorithms. - Christo Meriwether Keller; Stephan J. Eidenbenz; Andreas Bärtschi; Daniel O'Malley; John K. Golden; Satyajayant Misra (ISC, 2024)

Provable bounds for noise-free expectation values computed from noisy samples. - Samantha V. Barron; Daniel J. Egger; Elijah Pelofske; Andreas Bärtschi; Stephan J. Eidenbenz; Matthis Lehmkuehler; Stefan Woerner (Nat. Comput. Sci., 2024)

Quantum Graph Transformer for NLP Sentiment Classification. - Shamminuj Aktar; Andreas Bärtschi; Abdel-Hameed A. Badawy; Stephan J. Eidenbenz (CoRR, 2025)