


default search action
Information Processing Letters, Volume 190
Volume 190, 2025
- Daniel Eichhorn, Sven O. Krumke:
Online delay management on a single train line with predictions. 106569 - Dekel Tsur
:
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion. 106570 - Jan Kleinekathöfer
, Alireza Mahzoon, Rolf Drechsler:
Lower bound proof for the size of BDDs representing a shifted addition. 106571 - Jordan Dempsey
, Leo van Iersel, Mark Jones, Norbert Zeh:
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees. 106572 - Chao Yang
, Zhujun Zhang:
Friends-and-strangers is PSPACE-complete. 106573 - Takashi Ishizuka
:
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig. 106574 - Alexander Dobler
:
A note on the complexity of one-sided crossing minimization of trees. 106575 - Luis Sánchez-Fernández
:
A note on the method of equal shares. 106576 - George Christodoulou, Vasilis Christoforidis:
Fair and truthful allocations under leveled valuations. 106577 - Rodrigo Alexander Castro Campos:
The longest common subsequence problem for small alphabets in the word RAM model. 106579 - Jianming Lin, Weize Wang, Chang-An Zhao, Yuhao Zheng:
Efficient Implementations of Square-root Vélu's Formulas. 106580 - Jittat Fakcharoenphol, Nonthaphat Wongwattanakij:
A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k. 106581

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.