default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 94
Volume 94, Number 1, April 2005
- Janja Jerebic
, Sandi Klavzar, Simon Spacapan:
Characterizing r-perfect codes in direct products of two and three cycles. 1-6 - Ioannis Koutis:
A faster parameterized algorithm for set packing. 7-9 - Róbert Lórencz, Josef Hlavác:
Subtraction-free Almost Montgomery Inverse algorithm. 11-14 - Stavros G. Kolliopoulos:
Minimum-cost single-source 2-splittable flow. 15-18 - Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation results for a bicriteria job scheduling problem on a single machine without preemption. 19-27 - Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. 29-35 - Mohammad Sohel Rahman, Mohammad Kaykobad:
On Hamiltonian cycles and Hamiltonian paths. 37-41 - Sanguthevar Rajasekaran, Sandeep Sen:
A generalization of the 0-1 principle for sorting. 43-47
Volume 94, Number 2, April 2005
- Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson:
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. 49-53 - Evan J. Griffiths, Pekka Orponen:
Optimization, block designs and No Free Lunch theorems. 55-61 - Ji-Bo Wang, Zun-Quan Xia:
Scheduling jobs under decreasing linear deterioration. 63-69 - Angela Bonifati, Stefano Ceri, Stefano Paraboschi:
Event Trace Independence of active behavior. 71-77 - Annabelle McIver, Carroll Morgan:
An elementary proof that Herman's Ring is Theta (N2). 79-84 - Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Asynchronous bounded lifetime failure detectors. 85-91 - Mohammad Sohel Rahman, Mohammad Kaykobad:
Complexities of some interesting problems on spanning trees. 93-97
Volume 94, Number 3, May 2005
- Gautam Appa, Dimitris Magos, Ioannis Mourtos:
On the system of two all_different predicates. 99-105 - Christian Liebchen, Romeo Rizzi:
A greedy approach to compute a minimum cycle basis of a directed graph. 107-112 - L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo:
On the cubicity of certain graphs. 113-118 - Guang Xu, Jinhui Xu:
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. 119-123 - Kuo-Chu Lee, Chi-Hung Tzeng, Shing-Tsaan Huang:
A space-efficient self-stabilizing algorithm for measuring the size of ring networks. 125-130 - J. Y. Guo, Frank K. Hwang:
An almost-linear time and linear space algorithm for the longest common subsequence problem. 131-135 - Mike Burmester, Yvo Desmedt:
A secure and scalable Group Key Exchange system. 137-143 - Bruno Codenotti, Daniel Stefankovic:
On the computational complexity of Nash equilibria for (0, 1) bimatrix games. 145-150
Volume 94, Number 4, May 2005
- Vesa Halava, Tero Harju, Michel Latteux:
Equality sets of prefix morphisms and regular star languages. 151-154 - Juha Honkala:
The class of HDT0L sequences is closed with respect to rational functions. 155-158 - Alex Brodsky:
An impossibility gap between width-4 and width-5 permutation branching programs. 159-164 - Guy-Vincent Jourdan, Hasan Ural, Nejib Zaguia:
Minimizing the number of inputs while applying adaptive test cases. 165-169 - Orestis Telelis, Vassilis Zissimopoulos:
Absolute o(log m) error in approximating random set covering: an average case analysis. 171-177 - Vadim V. Lozin:
Between 2- and 3-colorability. 179-182 - Danilo Korze, Aleksander Vesel:
L(2, 1)-labeling of strong products of cycles. 183-190 - Jun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig:
Super connectivity of line graphs. 191-195
Volume 94, Number 5, June 2005
- Steven Minsker:
The Little Towers of Antwerpen problem. 197-201 - Ted Herman, Colette Johnen:
Strategies for peer-to-peer downloading. 203-209 - Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang:
An improved algorithm for the maximum agreement subtree problem. 211-216 - Olivier Danvy, Lasse R. Nielsen:
CPS transformation of beta-redexes. 217-224 - Yinfeng Xu, Wenqiang Dai, Binhai Zhu:
A lower bound on the edge linfinitely radius of Saitou and Nei's method for phylogenetic reconstruction. 225-230 - Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Closure properties and decision problems of dag automata. 231-240
Volume 94, Number 6, 30 June 2005
- Philippe Darondeau:
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. 241-245 - Alexander Thomasian, Yue Li, Lijuan Zhang:
Exact k-NN queries on clustered SVD datasets. 247-252 - Aleksander Madry:
Data exchange: On the complexity of answering queries with inequalities. 253-257 - Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k-point enclosing rectangle and square of arbitrary orientation. 259-266 - Jan A. Bergstra, Inge Bethke:
An upper bound for the equational specification of finite state services. 267-269 - King Sing Cheung, K. O. Chow:
Cycle inclusion property of augmented marked graphs. 271-276 - Sujatha Kashyap, Vijay K. Garg:
Intractability results in predicate detection. 277-282
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.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
