Sciweavers

Share
COCOON
2011
Springer
7 years 10 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
COCOON
2011
Springer
7 years 10 months ago
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
COCOON
2011
Springer
7 years 10 months ago
Proper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...
CPM
2011
Springer
402views Combinatorics» more  CPM 2011»
8 years 1 months ago
Tractability Results for the Consecutive-Ones Property with Multiplicity
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1...
Cedric Chauve, Ján Manuch, Murray Patterson...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
8 years 1 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
8 years 5 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
8 years 8 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
COCOON
2009
Springer
8 years 8 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...

0
posts
with
0
views
243profile views
Mark C. WilsonProfessor, Associate
University of Auckland
Mark C. Wilson
COCOON
2010
Springer
8 years 8 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
books