The declaration of Major Generall Massey concerning his comming into England to assist his dread Soveraign Lord the King [[electronic resource] ] : and to be Lieutenant-Generall under His Highnesse the Prince of Wales. With his message to the Queen of England, and the Prince concerning the same. Also, a relation of the relieving of Colchester, and a list of the Duke of York his navie, concerning their proceedings, and their sayling towards England. Likewise, joyfull propositions from the House of Peeres, concerning a personall treaty with the Kings Majesty, to compose all differences between the King and His people, and to settle the Kingdome in peace and unity, to the great joy and comfort of all true-hearted subjects

• Record Nr.: UNISA996392283803316
• Autore: Massey Edward, Sir, <1619?-1674?>
• Pubbl/distr/stampa: [London], : Printed for generall satisfaction of all that desires peace, [1648]
• Descrizione fisica: [2], 1, [5] p
• Soggetti: Colchester (England) History Siege, 1648 Early works to 1800
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Place and date of publication from Wing.; Annotation on Thomason copy: "July 13".; Imperfect: print show-through with some loss of text.; Reproduction of the original in the British Library.
• Sommario/riassunto: eebo-0018

Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin

• Record Nr.: UNINA9910484324703321
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
• ISBN: 3-642-11269-2
• Edizione: [1st ed. 2009.]
• Descrizione fisica: 1 online resource (X, 335 p. 26 illus.)
• Collana: Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5917
• Classificazione: 004; DAT 517f; SS 4800
• Altri autori (Persone): ChenJianer; FominFedor V
• Disciplina: 519.544
• Soggetti: Computer programming; Discrete mathematics; Computer science - Mathematics; Algorithms; Programming Techniques; Discrete Mathematics; Mathematics of Computing; Discrete Mathematics in Computer Science
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Includes index.
• Nota di contenuto: Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the ; Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n .
• Sommario/riassunto: The Workshop on Parameterized and Exact Computation (IWPEC) is an - ternational workshop series that covers research in all aspects of parameterized and exact algorithms and complexity, and especially encourages the study of parameterized and exact computations for real-world applications and algori- mic engineering. The goal of the workshop is to present recent research results, including signi'cant work-in-progress,and to identify and explore directions for future research. IWPEC2009wasthefourthworkshopintheseries,heldinCopenhagen,D- mark, during September 10-11, 2009. The workshop was part of ALGO 2009, which also hosted the 17th European Symposium on Algorithms (ESA 2009), the 9th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2009), and the 7th Workshop on Appr- imation and Online Algorithms (WAOA 2009). Three previous meetings of the IWPEC series were held in Bergen, Norway, 2004, Zu ¨rich, Switzerland, 2006, and Victoria, Canada, 2008. At IWPEC 2009, we had two plenary speakers,Noga Alon (Tel Aviv Univ- sity, Israel) and Hans Bodlaender (Utrecht University, The Netherlands), giving 50-minutetalkseach.ProfessorAlonspokeon"ColorCoding,BalancedHashing andApproximateCounting," andProfessorBodlaenderon"Kernelization:New Upper and Lower Bound Techniques." Their respective abstracts accompanying the talks are included in these proceedings. InresponsetotheCallforPapers,52papersweresubmitted.Eachsubmission was reviewed by at least three reviewers (most by at least four). The reviewers were either Program Committee members or invited external reviewers. The ProgramCommittee held electronic meetings using the EasyChair system, went throughthoroughdiscussions,andselected25ofthesubmissionsforpresentation at the workshop and inclusion in this LNCS volume.