io-port.net

io-port 06112975 Chechik, Shiri; Langberg, Michael; Peleg, David; Roditty, Liam

$f$-sensitivity distance oracles and routing schemes. (English)

Algorithmica 63, No. 4, 861-882 (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112974 Bansal, Nikhil; Gupta, Anupam; Li, Jian; Mestre, Julián; Nagarajan, Viswanath; Rudra, Atri

When LP is the cure for your matching woes: improved bounds for stochastic matchings. (English)

Algorithmica 63, No. 4, 733-762 (2012).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112973 Brodal, Gerth Stølting; Davoodi, Pooya; Rao, S.Srinivasa

On space efficient two dimensional range minimum data structures. (English)

Algorithmica 63, No. 4, 815-830 (2012).

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112972 Hajiaghayi, M.; Khandekar, R.; Kortsarz, G.

Local search algorithms for the red-blue median problem. (English)

Algorithmica 63, No. 4, 795-814 (2012).

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112971 Pountourakis, Emmanouil; Vidali, Angelina

A complete characterization of group-strategyproof mechanisms of cost-sharing. (English)

Algorithmica 63, No. 4, 831-860 (2012).

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112970 Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto

Feasibility analysis of sporadic real-time multiprocessor task systems. (English)

Algorithmica 63, No. 4, 763-780 (2012).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06112969 Chrobak, Marek; Woeginger, Gerhard J.; Makino, Kazuhisa; Xu, Haifeng

Caching is hard ‒ even in the fault model. (English)

Algorithmica 63, No. 4, 781-794 (2012).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109465 Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; van Leeuwen, Erik Jan

Parameterized complexity of the spanning tree congestion problem. (English)

Algorithmica 64, No. 1, 85-111 (2012).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109464 Crowston, Robert; Gutin, Gregory; Jones, Mark; Yeo, Anders

A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications. (English)

Algorithmica 64, No. 1, 56-68 (2012).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109463 Binkele-Raible, Daniel; Fernau, Henning

Parameterized measure \& conquer for problems with no small kernels. (English)

Algorithmica 64, No. 1, 189-212 (2012).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109462 Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry

An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion. (English)

Algorithmica 64, No. 1, 170-188 (2012).

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109461 Achilleos, Antonis; Lampis, Michael; Mitsou, Valia

Parameterized modal satisfiability. (English)

Algorithmica 64, No. 1, 38-55 (2012).

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109460 Lampis, Michael

Algorithmic meta-theorems for restrictions of treewidth. (English)

Algorithmica 64, No. 1, 19-37 (2012).

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109459 Cao, Yixin; Chen, Jianer

Cluster editing: kernelization based on edge cuts. (English)

Algorithmica 64, No. 1, 152-169 (2012).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109458 Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.

Fast minor testing in planar graphs. (English)

Algorithmica 64, No. 1, 69-84 (2012).

15

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109457 Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.

Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. (English)

Algorithmica 64, No. 1, 3-18 (2012).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109456 Dorn, Britta; Schlotter, Ildikó

Multivariate complexity analysis of Swap Bribery. (English)

Algorithmica 64, No. 1, 126-151 (2012).

17

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109455 Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, Anders

Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming. (English)

Algorithmica 64, No. 1, 112-125 (2012).

18

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109324 Nussbaum, Doron; Pu, Shuye; Sack, Jörg-Rüdiger; Uno, Takeaki; Zarrabi-Zadeh, Hamid

Finding maximum edge bicliques in convex bipartite graphs. (English)

Algorithmica 64, No. 2, 311-325 (2012).

19

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06109323 Holroyd, Alexander E.; Ruskey, Frank; Williams, Aaron

Shorthand universal cycles for permutations. (English)

Algorithmica 64, No. 2, 215-245 (2012).

20

PDF XML AMS-TeX TEXT BIBTeX DOI