A grammar of Abui: A Papuan language of Alor

This work contains the first comprehensive description of Abui, a language of the Trans New Guinea family spoken approximately by 16,000 speakers in the central part of the Alor Island in Eastern Indonesia. The description focuses on the northern dialect of Abui as spoken in the village Takalelang. This study is based on primary data collected by the author on Alor. With Pantar island, Alor Island is the western-most area where Papuan languages are spoken. Abui syntax is characterized by rigid head-final word order. The language presents a number of typologically interesting features such as semantic alignment. Characteristic for Abui is the extensive use of generic verbs. Generic verbs appear as parts of complex verbs or in serial verb constructions. This grammar covers the phonology, morphology and basic syntax of Abui. The appendix contains several Abui texts and word lists. Not being written against any particular theoretical background, this book is of interest to scholars of both Papuan and Austronesian languages, as well as linguistic typology.LEI Universiteit LeidenLanguage Use in Past and Presen

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous if it admits a b-coloring with t colors, for every t = \chi(G),\ldots,\chi_b(G), and b-monotonic if \chi_b(H_1) \geq \chi_b(H_2) for every induced subgraph H_1 of G, and every induced subgraph H_2 of H_1. We investigate the b-chromatic number of graphs with stability number two. These are exactly the complements of triangle-free graphs, thus including all complements of bipartite graphs. The main results of this work are the following: - We characterize the b-colorings of a graph with stability number two in terms of matchings with no augmenting paths of length one or three. We derive that graphs with stability number two are b-continuous and b-monotonic. - We prove that it is NP-complete to decide whether the b-chromatic number of co-bipartite graph is at most a given threshold. - We describe a polynomial time dynamic programming algorithm to compute the b-chromatic number of co-trees. - Extending several previous results, we show that there is a polynomial time dynamic programming algorithm for computing the b-chromatic number of tree-cographs. Moreover, we show that tree-cographs are b-continuous and b-monotonic

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether a given graph G allows a homomorphism to a given graph H that is locally bijective, surjective, or injective, respectively, are NP-complete, even when G has pathwidth at most 5, 4 or 2, respectively, or when both G and H have maximum degree 3. We complement these hardness results by showing that the three problems are polynomial-time solvable if G has bounded treewidth and in addition G or H has bounded maximum degree

On Vertex- and Empty-Ply Proximity Drawings

We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equal to half the length of the longest edge incident to the vertex. The vertex-ply of a drawing is determined by the vertex covered by the maximum number of disks. The main motivation for considering this relaxation is to relate the concept of ply to proximity drawings. In fact, if we interpret the set of disks as proximity regions, a drawing with vertex-ply number 1 can be seen as a weak proximity drawing, which we call empty-ply drawing. We show non-trivial relationships between the ply number and the vertex-ply number. Then, we focus on empty-ply drawings, proving some properties and studying what classes of graphs admit such drawings. Finally, we prove a lower bound on the ply and the vertex-ply of planar drawings.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Intersection Graphs of L-Shapes and Segments in the Plane

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: ⌊,⌈,⌋ and ⌉. A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph admits an intersection representation in which every vertex is represented by an ⌊, an ⌊ or ⌈, a k-bend path, or a segment, then this graph is called an ⌊-graph, ⌊,⌈-graph, B k -VPG-graph or SEG-graph, respectively. Motivated by a theorem of Middendorf and Pfeiffer [Discrete Mathematics, 108(1):365–372, 1992], stating that every ⌊,⌈-graph is a SEG-graph, we investigate several known subclasses of SEG-graphs and show that they are ⌊-graphs, or B k -VPG-graphs for some small constant k. We show that all planar 3-trees, all line graphs of planar graphs, and all full subdivisions of planar graphs are ⌊-graphs. Furthermore we show that all complements of planar graphs are B 19-VPG-graphs and all complements of full subdivisions are B 2-VPG-graphs. Here a full subdivision is a graph in which each edge is subdivided at least once

List coloring in the absence of a linear forest.

The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)⊆{1,…,k}. Let Pn denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. For any two fixed integers k and r, we show that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of Hoàng, Kamiński, Lozin, Sawada and Shu for graphs with no induced P5. Our result is tight; we prove that for any graph H that is a supergraph of P1+P5 with at least 5 edges, already List 5-Coloring is NP-complete for graphs with no induced H

Effect of dexamethasone in patients with ARDS and COVID-19 - prospective, multi-centre, open-label, parallel-group, randomised controlled trial (REMED trial): A structured summary of a study protocol for a randomised controlled trial.

OBJECTIVES: The primary objective of this study is to test the hypothesis that administration of dexamethasone 20 mg is superior to a 6 mg dose in adult patients with moderate or severe ARDS due to confirmed COVID-19. The secondary objective is to investigate the efficacy and safety of dexamethasone 20 mg versus dexamethasone 6 mg. The exploratory objective of this study is to assess long-term consequences on mortality and quality of life at 180 and 360 days. TRIAL DESIGN: REMED is a prospective, phase II, open-label, randomised controlled trial testing superiority of dexamethasone 20 mg vs 6 mg. The trial aims to be pragmatic, i.e. designed to evaluate the effectiveness of the intervention in conditions that are close to real-life routine clinical practice. PARTICIPANTS: The study is multi-centre and will be conducted in the intensive care units (ICUs) of ten university hospitals in the Czech Republic. INCLUSION CRITERIA: Subjects will be eligible for the trial if they meet all of the following criteria: 1. Adult (≥18 years of age) at time of enrolment; 2. Present COVID-19 (infection confirmed by RT-PCR or antigen testing); 3. Intubation/mechanical ventilation or ongoing high-flow nasal cannula (HFNC) oxygen therapy; 4. Moderate or severe ARDS according to Berlin criteria:  • Moderate - PaO2/FiO2 100-200 mmHg;  • Severe - PaO2/FiO2 < 100 mmHg; 5. Admission to ICU in the last 24 hours. EXCLUSION CRITERIA: Subjects will not be eligible for the trial if they meet any of the following criteria: 1. Known allergy/hypersensitivity to dexamethasone or excipients of the investigational medicinal product (e.g. parabens, benzyl alcohol); 2. Fulfilled criteria for ARDS for ≥14 days at enrolment; 3. Pregnancy or breastfeeding; 4. Unwillingness to comply with contraception measurements from enrolment until at least 1 week after the last dose of dexamethasone (sexual abstinence is considered an adequate contraception method); 5. End-of-life decision or patient is expected to die within next 24 hours; 6. Decision not to intubate or ceilings of care in place; 7. Immunosuppression and/or immunosuppressive drugs in medical history:  a) Systemic immunosuppressive drugs or chemotherapy in the past 30 days;  b) Systemic corticosteroid use before hospitalization;  c) Any dose of dexamethasone during the present hospital stay for COVID-19 for ≥5 days before enrolment;  d) Systemic corticosteroids during present hospital stay for conditions other than COVID-19 (e.g. septic shock); 8. Current haematological or generalized solid malignancy; 9. Any contraindication for corticosteroid administration, e.g.  • intractable hyperglycaemia;  • active gastrointestinal bleeding;  • adrenal gland disorders;  • presence of superinfection diagnosed with locally established clinical and laboratory criteria without adequate antimicrobial treatment; 10. Cardiac arrest before ICU admission; 11. Participation in another interventional trial in the last 30 days. INTERVENTION AND COMPARATOR: Dexamethasone solution for injection/infusion is the investigational medicinal product as well as the comparator. The trial will assess two doses, 20 mg (investigational) vs 6 mg (comparator). Patients in the intervention group will receive dexamethasone 20 mg intravenously once daily on day 1-5, followed by dexamethasone 10 mg intravenously once daily on day 6-10. Patients in the control group will receive dexamethasone 6 mg day 1-10. All authorized medicinal products containing dexamethasone in the form of solution for i.v. injection/infusion can be used. MAIN OUTCOMES: Primary endpoint: Number of ventilator-free days (VFDs) at 28 days after randomisation, defined as being alive and free from mechanical ventilation. SECONDARY ENDPOINTS: a) Mortality from any cause at 60 days after randomisation; b) Dynamics of inflammatory marker (C-Reactive Protein, CRP) change from Day 1 to Day 14; c) WHO Clinical Progression Scale at Day 14; d) Adverse events related to corticosteroids (new infections, new thrombotic complications) until Day 28 or hospital discharge; e) Independence at 90 days after randomisation assessed by Barthel Index. The long-term outcomes of this study are to assess long-term consequences on mortality and quality of life at 180 and 360 days through telephone structured interviews using the Barthel Index. RANDOMISATION: Randomisation will be carried out within the electronic case report form (eCRF) by the stratified permuted block randomisation method. Allocation sequences will be prepared by a statistician independent of the study team. Allocation to the treatment arm of an individual patient will not be available to the investigators before completion of the whole randomisation process. The following stratification factors will be applied: • Age <65 and ≥ 65; • Charlson Comorbidity index (CCI) <3 and ≥3; • CRP <150 mg/L and ≥150 mg/L • Trial centre. Patients will be randomised in a 1 : 1 ratio into one of the two treatment arms. Randomisation through the eCRF will be available 24 hours every day. BLINDING (MASKING): This is an open-label trial in which the participants and the study staff will be aware of the allocated intervention. Blinded pre-planned statistical analysis will be performed. NUMBERS TO BE RANDOMISED (SAMPLE SIZE): The sample size is calculated to detect the difference of 3 VFDs at 28 days (primary efficacy endpoint) between the two treatment arms with a two-sided type I error of 0.05 and power of 80%. Based on data from a multi-centre randomised controlled trial in COVID-19 ARDS patients in Brazil and a multi-centre observational study from French and Belgian ICUs regarding moderate to severe ARDS related to COVID-19, investigators assumed a standard deviation of VFD at 28 days as 9. Using these assumptions, a total of 142 patients per treatment arm would be needed. After adjustment for a drop-out rate, 150 per treatment arm (300 patients per study) will be enrolled. TRIAL STATUS: This is protocol version 1.1, 15.01.2021. The trial is due to start on 2 February 2021 and recruitment is expected to be completed by December 2021. TRIAL REGISTRATION: The study protocol was registered on EudraCT No.:2020-005887-70, and on December 11, 2020 on ClinicalTrials.gov (Title: Effect of Two Different Doses of Dexamethasone in Patients With ARDS and COVID-19 (REMED)) Identifier: NCT04663555 with a last update posted on February 1, 2021. FULL PROTOCOL: The full protocol (version 1.1) is attached as an additional file, accessible from the Trials website (Additional file 1). In the interest of expediting dissemination of this material, the standard formatting has been eliminated; this Letter serves as a summary of the key elements of the full protocol

The Complexity of Drawing a Graph in a Polygonal Region

We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to create a planar straight-line drawing of the graph inside the region. This strengthens an NP-hardness result by Patrignani on extending partial planar graph drawings. Our result is one of the first showing that a problem of drawing planar graphs with straight-line edges is hard for the existential theory of the reals. The complexity of the problem is open in the case of a simply connected region. We also show that, even for integer input coordinates, it is possible that drawing a graph in a polygonal region requires some vertices to be placed at irrational coordinates. By contrast, the coordinates are known to be bounded in the special case of a convex region, or for drawing a path in any polygonal region.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

Open problems on graph coloring for special graph classes.

For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c:V→{1,2,…}c:V→{1,2,…} such that c(u)≠c(v)c(u)≠c(v) for every edge uv∈Euv∈E. We survey known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring

A separator theorem for string graphs and its applications

A string graph is the intersection graph of a collection of continuous arcs in the plane. We show that any string graph with in edges can be separated into two parts of roughly equal size by the removal of O(m(3/4)root log m) vertices. This result is then used to deduce that every string graph with n vertices and no complete bipartite subgraph K-t,K-t has at most c(t)n edges, where c(t) is a constant depending only on t. Another application shows that locally tree-like string graphs are globally tree-like: for any epsilon > 0, there is an integer g(epsilon) such that every string graph with n vertices and girth at least g(epsilon) has at most (1 + epsilon)n edges. Furthermore, the number of such labelled graphs is at most (1 + epsilon)(n) T(n), where T(n) = n(n-2) is the number of labelled trees on n vertices