New bounds for the number of lightest cycles in undirected graphs
- Hassene Aissi
- Mourad Baiou
- et al.
- 2025
- Information Processing Letters
Publications
82 results at Information Processing Letters
On maximum leaf trees and connections to connected maximum cut problems
- Rajiv Gandhi
- Mohammad Taghi Hajiaghayi
- et al.
- 2018
- Information Processing Letters
A note on sparse least-squares regression
- Christos Boutsidis
- Malik Magdon-Ismail
- 2014
- Information Processing Letters
A note on the Kenyon-Remila strip-packing algorithm
- Maxim Sviridenko
- 2012
- Information Processing Letters
A factor 2 approximation algorithm for the vertex cover P 3 problem
- Jianhua Tu
- Wenli Zhou
- 2011
- Information Processing Letters
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
- Yusuke Matsumoto
- Naoyuki Kamiyama
- et al.
- 2011
- Information Processing Letters
Approximating the Minimum Chain Completion problem
- Tomás Feder
- Heikki Mannila
- et al.
- 2009
- Information Processing Letters
Fork sequential consistency is blocking
- Christian Cachin
- Idit Keidar
- et al.
- 2009
- Information Processing Letters
An algorithm for partitioning trees augmented with sibling edges
- Rajesh Bordawekar
- Oded Shmueli
- 2008
- Information Processing Letters
Wait-free regular storage from Byzantine components
- Ittai Abraham
- Gregory Chockler
- et al.
- 2007
- Information Processing Letters