TAMC 2007 - PDF Preprint Papers

TAMC 2007 Theory and Applications of Models of Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TAMC-2007 Paper

click to vote

TAMC
2007
Springer

183views Applied Computing» more TAMC 2007»

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

14 years 5 months ago

Download theinf1.informatik.uni-jena.de

Abstract. We develop a reﬁnement of a forbidden submatrix characterization of 0/1-matrices fulﬁlling the Consecutive Ones Property (C1P). This novel characterization ﬁnds app...

Michael Dom, Jiong Guo, Rolf Niedermeier

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	183	Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems	claim
2	161	Approximation Algorithms for 3D Orthogonal Knapsack	claim
3	146	The Undecidability of the Generalized Collatz Problem	claim
4	142	A Note on Universal Composable Zero Knowledge in Common Reference String Model	claim
5	131	Synchronization of Some DFA	claim
6	128	Improving the Average Delay of Sorting	claim
7	118	A Note on the Feasibility of Generalized Universal Composability	claim
8	114	Kernelizations for Parameterized Counting Problems	claim
9	107	A Characterization of the Language Classes Learnable with Correction Queries	claim
10	101	Phase Transition of Multivariate Polynomial Systems	claim
11	95	On Deciding Deep Holes of Reed-Solomon Codes	claim
12	95	Quantum Multiparty Communication Complexity and Circuit Lower Bounds	claim
13	92	Approximately Optimal Trees for Group Key Management with Batch Updates	claim
14	85	Directed Searching Digraphs: Monotonicity and Complexity	claim
15	85	The Strongest Nonsplitting Theorem	claim
16	81	Finding a Duplicate and a Missing Item in a Stream	claim
17	80	Working with the LR Degrees	claim
18	77	Efficient Algorithms for Airline Problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers