Author: "Univerzita Karlova v Praze" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Univerzita Karlova v Praze"' showing total 369 results

Start Over Author "Univerzita Karlova v Praze"

369 results on '"Univerzita Karlova v Praze"'

1. Multi-Modal Intervention In Frail And Prefrail Older People With Type 2 Diabetes (MID-Frail)

Author: Cardiff University, Igen Biotech SL, University Hospital, Bordeaux, Hexabio Sarl, University of Campania 'Luigi Vanvitelli', University Hospital, Toulouse, University of Ulm, University Ghent, University of Castilla-La Mancha, Univerzita Karlova v Praze, Niche Science & Technology Ltd, Catholic University of the Sacred Heart, Vrije Universiteit Brussel, and Diabetes Frail Ltd
Published: 2019

2. Efficacy, Safety and Pharmacokinetic Study of Intravenous Clonidine Versus Midazolam for Sedation in Paediatric Patients (CloSed1)

Author: Erasmus Medical Center, University of Tartu, Therakind Ltd, Gianni Benzi Pharmacological Research Foundation, University College, London, Karolinska Institutet, Univerzita Karlova v Praze, Vereniging Samenwerkende Ouder- En Patientenorganisaties, Bambino Gesù Hospital and Research Institute, European Commission, ARNAS Civico Di Cristina Benfratelli Hospital, and Servicio Madrileño de Salud, Madrid, Spain
Published: 2019

3. Proteomic Prediction and Renin Angiotensin Aldosterone System Inhibition Prevention Of Early Diabetic nephRopathy In TYpe 2 Diabetic Patients With Normoalbuminuria (PRIORITY)

Author: Mosaiques Diagnostics GmbH, University Medical Center Groningen, University of Glasgow, Istituto Di Ricerche Farmacologiche Mario Negri, Univerzita Karlova v Praze, Geniko Nosokomeio Athinas Ippokrateio, Institut Klinické a Experimentální Mediciny Praze, Instituto de Investigación Sanitaria de la Fundación Jiménez Díaz, Klinikum St. Georg Leipzig, Cyril and Methodius University in Skopje, Hannover Clinical Trial Center, European Commission, Diabetes Vascular Research Foundation Hoogeveen, Universitair Ziekenhuis Gent, Universitätsklinikum Carl Gustav Carus an der Technischen Universität Dresden, Stichting VUMC, Diabetologen Hessen, and Peter Rossing, Professor, Chief Physician, MD, DMSc
Published: 2018

4. Nová publikace 'Exploring regional sustainable development issues. Using the case study approach in higher education' dostupná on-line.

Author: Dlouhý, Jiří; Univerzita Karlova v Praze and Dlouhý, Jiří; Univerzita Karlova v Praze
Abstract: S tématem udržitelného rozvoje na regionální (a globální) úrovni souvisí nedávno publikovaná kniha "Exploring regional sustainable development issues. Using the case study approach in higher education" editorů Andrew Bartona a Jany Dlouhé. Jsou zde rekapitulována teoretická východiska pro užití případových studií ve výuce (především na vysokoškolské úrovni, kde představují vhodnou formupředstavení kvalitativních metod výzkumu a jejich využití praxi; obsahuje dále celkem sedm případových studií udržitelného rozvoje, které byly použity jako otevřené vzdělávací zdroje v mezinárodních programech výuky (především v programu ISPoS a EVS). Plný text knihy je dostupný zde.Vznik publikace byl podpořen z projektu MOSUR a projektů TAČR Omega "Metodika tvorby a využití tzv. Open Educational Resources (TD020400)" a "Studium a podpora procesů participativní tvorby regionálních strategií UR (TD020120)"., In the framework of the project MOSUR and TAČR projects “Analysis and support for participatory decision-making processes aimed at regional sustainable development strategies through the use of actor analysis methodology” (2014‑2015); and “Use of regional sustainable development case studies in higher education and for the creation of Open Educational Resources” has our Center published the book "Exploring regional sustainable development issues. Using the case study approach in higher education". Book was edited by Andrew Barton and Jana Dlouhá. It brings together a total of seven regional sustainable development case studies that have been used as teaching materials for e-learning courses at the Charles University Environment Center in Prague, Czech Republic, and which form a part of its open education resources. Full text of the book is available here.This book brings together a total of seven regional sustainable development case studies that have been used as teaching materials for e-learning courses at the Charles University Environment Center in Prague, Czech Republic, and which form a part of its open education resources. These case studies are accompanied in the opening pages of the book by two chapters describing the methods and approaches that we applied when teaching our e-learning courses and international summer schools held in the mountains of North Bohemia in partnerships with the Leuphana University of Lueneburg. The first chapter describes in detail the methods used in studying regional sustainable development issues from a case study perspective. The second chapter focuses on the Actor Analysis method, which was originally introduced to us by our colleagues from Leuphana University, and the third provides an example of how this method is used in a specific case in the Czech Republic. The other case studies presented here were mostly used in the context of Globalization courses accredited at Charles University and offered on an interdisciplinary b
Published: 2015

5. The Solar Orbiter Radio and Plasma Waves (RPW) instrument (Corrigendum)

Author: Andris Vaivads, V. Krupař, M. Chariet, Lars Bylander, L. R. Malac-Allain, J. Parisot, Mats André, W. Recart, W. Puccio, C. Agrapart, D. Bérard, V. Leray, Robert F. Wimmer-Schweingruber, K. Boughedada, Baptiste Cecconi, E. Lorfèvre, M. Steller, B. Katra, F. Chapron, Helmut O. Rucker, Stuart D. Bale, Matthieu Kretzschmar, J.-C. Pellion, Ivana Kolmasova, J. Sanisidro, N. Quéruel, Filippo Pantellini, V. Bouzid, Laurent Lamy, Milan Maksimovic, L. Guéguen, C. Fiachetti, S. Chaintreuil, Mykhaylo Panchenko, Karine Issautier, M. Dekkali, O. Krupařová, Keith Goetz, Tomas Karlsson, I. Fratter, H. Ottacher, Philippe Louarn, P. Fergeau, O. Le Contel, Christopher J. Owen, Jan Soucek, A. Retino, Mihailo M. Martinović, Y. de Conchy, Olga Alexandrova, E. Bellouard, G. T. Delory, David Pisa, S. Thijs, E. Guilhem, Anders Eriksson, L. Åhlén, Antonio Vecchio, Timothy S. Horbury, Ondrej Santolik, Eduard P. Kontar, T. Vincent, V. Cripps, Daniel Dias, I. Zouganelis, A. Jeandet, T. Dudok de Wit, Sonny Lion, L. Uhlíř, Quynh Nhu Nguyen, M. Timofeeva, Dirk Plettemeier, J. Baše, Christopher Cully, Petr Hellinger, Lorenzo Matteini, Fouad Sahraoui, C. Collin, Paul Turin, Javier Rodriguez-Pacheco, Säm Krucker, P. Plasson, J.-Y. Brochot, Vladimir Krasnoselskikh, P. Leroy, Petr Travnicek, R. Lán, Yu. V. Khotyaintsev, S.-E. Jansson, Štěpán Štverák, G. Barbary, Pierre Astier, G. Jannet, R. Piberne, E. P. G. Johansson, F. Gonzalez, P. Danto, Arnaud Zaslavsky, J. Břínek, Thomas Chust, Xavier Bonnin, C. Laffaye, G. Cassam-Chenai, S. Julien, B. Pontet, Matthieu Berthomier, Laboratoire d'études spatiales et d'instrumentation en astrophysique (LESIA (UMR_8109)), Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Space Sciences Laboratory [Berkeley] (SSL), University of California [Berkeley], University of California-University of California, Laboratoire de Physique des Plasmas (LPP), Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École polytechnique (X)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Swedish Institute of Space Physics [Uppsala] (IRF), Laboratoire de Physique et Chimie de l'Environnement et de l'Espace (LPC2E), Observatoire des Sciences de l'Univers en région Centre (OSUC), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Centre National d’Études Spatiales [Paris] (CNES), Technische Universität Dresden = Dresden University of Technology (TU Dresden), Commission for Astronomy of the Austrian Academy of Sciences, Austrian Academy of Sciences (OeAW), Institute of Atmospheric Physics [Prague] (IAP), Czech Academy of Sciences [Prague] (CAS), Space Research Institute of Austrian Academy of Sciences (IWF), Royal Institute of Technology [Stockholm] (KTH ), Unité Scientifique de la Station de Nançay (USN), Centre National de la Recherche Scientifique (CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire des Sciences de l'Univers en région Centre (OSUC), Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Université d'Orléans (UO), Nexeya Conseil & Formation, Institute for Mathematics, Astrophysics and Particle Physics (IMAPP), Radboud university [Nijmegen], Centre National d'Études Spatiales [Toulouse] (CNES), Centre d’Ecologie Fonctionnelle et Evolutive (CEFE), Université Paul-Valéry - Montpellier 3 (UPVM)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), ALTRAN (FRANCE), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES), Univerzita Karlova v Praze, Universities Space Research Association (USRA), NASA Goddard Space Flight Center (GSFC), Department of Physics and Astronomy [Calgary], University of Calgary, School of Physics and Astronomy [Minneapolis], University of Minnesota [Twin Cities] (UMN), University of Minnesota System-University of Minnesota System, Department of Physics [Imperial College London], Imperial College London, University of Glasgow, Fachhochschule Nordwestschweiz [Windisch] (FHNW), Institut de recherche en astrophysique et planétologie (IRAP), Institut national des sciences de l'Univers (INSU - CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Centre National de la Recherche Scientifique (CNRS), Lunar and Planetary Laboratory [Tucson] (LPL), University of Arizona, University of Belgrade [Belgrade], Mullard Space Science Laboratory (MSSL), University College of London [London] (UCL), Universidad de Alcalá - University of Alcalá (UAH), Institute of Experimental and Applied Physics [Kiel] (IEAP), Christian-Albrechts-Universität zu Kiel (CAU), European Space Astronomy Centre (ESAC), European Space Agency (ESA), Laboratoire d'études spatiales et d'instrumentation en astrophysique = Laboratory of Space Studies and Instrumentation in Astrophysics (LESIA), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), University of California [Berkeley] (UC Berkeley), University of California (UC)-University of California (UC), Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS), Radboud University [Nijmegen], Université Paul-Valéry - Montpellier 3 (UPVM)-École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro - Montpellier SupAgro, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Université de Rennes (UR), Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), and Agence Spatiale Européenne = European Space Agency (ESA)
Subjects: Physics, 010308 nuclear & particles physics, Astronomy, Astronomy and Astrophysics, Astrophysics, Plasma, 01 natural sciences, law.invention, instrumentation: miscellaneous, Solar wind, Orbiter, solar wind, Space and Planetary Science, law, 0103 physical sciences, [PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph], 010303 astronomy & astrophysics, addenda, ComputingMilieux_MISCELLANEOUS, errata
Abstract: Contains fulltext : 239392.pdf (Publisher’s version ) (Open Access)
Published: 2021
Full Text: View/download PDF

6. EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Sequence, Logic, 010102 general mathematics, 0102 computer and information sciences, Characterization (mathematics), 01 natural sciences, Combinatorics, Philosophy, Definable set, Monotone polygon, Integer, 010201 computation theory & mathematics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Standard probability space, Limit (mathematics), Ball (mathematics), 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract: A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel. It was known that FO-convergent sequence of graphs do not always admit a modeling limit, but it was conjectured that FO-convergent sequences of sufficiently sparse graphs have a modeling limits. Precisely, two conjectures were proposed:1.If a FO-convergent sequence of graphs is residual, that is if for every integer d the maximum relative size of a ball of radius d in the graphs of the sequence tends to zero, then the sequence has a modeling limit.2.A monotone class of graphs ${\cal C}$ has the property that every FO-convergent sequence of graphs from ${\cal C}$ has a modeling limit if and only if ${\cal C}$ is nowhere dense, that is if and only if for each integer p there is $N\left( p \right)$ such that no graph in ${\cal C}$ contains the pth subdivision of a complete graph on $N\left( p \right)$ vertices as a subgraph.In this article we prove both conjectures. This solves some of the main problems in the area and among others provides an analytic characterization of the nowhere dense–somewhere dense dichotomy.
Published: 2019
Full Text: View/download PDF

7. From χ to χp-bounded classes

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Yiting Jiang, Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), and European Project: DYNASNET
Subjects: Class (set theory), Even-hole-free graph, even-hole free graph, tree-depth coloring, Context (language use), 0102 computer and information sciences, Star (graph theory), restricted homomorphism duality, star coloring, topological minor, 01 natural sciences, Theoretical Computer Science, Combinatorics, Integer, χ-bounded, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Discrete Mathematics and Combinatorics, 0101 mathematics, χs -bounded, Mathematics, 010102 general mathematics, bounded expansion, Computational Theory and Mathematics, 010201 computation theory & mathematics, Scheme (mathematics), Bounded function, subdivision, Star coloring
Abstract: χ-bounded classes are studied here in the context of star colorings and, more generally, χ p -colorings. This fits to a general scheme of sparsity and leads to natural extensions of the notion of bounded expansion class. In this paper we solve two conjectures related to star coloring (i.e. χ 2 ) boundedness . One of the conjectures is disproved and in fact we determine which weakening holds true. χ p -boundedness leads to more stability and we give structural characterizations of (strong and weak) χ p -bounded classes. We also generalize a result of Wood relating the chromatic number of a graph to the star chromatic number of its 1-subdivision. As an application of our characterizations, among other things, we show that for every odd integer g > 3 even hole-free graphs G contain at most φ ( g , ω ( G ) ) | G | holes of length g.
Published: 2021
Full Text: View/download PDF

8. Au cœur des réseaux africano-soviétiques : archives et trajectoire de l’écrivain-cinéaste sénégalais Ousmane Sembène

Author: Françoise Blum, Gabrielle Chomentowski, Constantin Katsakioris, Centre d'histoire sociale du XXe siècle (CHS), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), Centre d'histoire sociale des mondes contemporains (CHS), and Univerzita Karlova v Praze
Subjects: Soviet Union, littérature africaine, Union soviétique, Union of Writers, guerre froide, literature, cinema, cinéma, Ousmane Sembène, [SHS.HIST]Humanities and Social Sciences/History, Ousmane Sembene, circulations littéraires, [SHS]Humanities and Social Sciences
Abstract: International audience; This article presents the correspondence of the Senegalese Ousmane Sembene with Soviet writers, officials and his translator, as well as a discussion he held with Soviet writers at the house of the Union of Writers of the USSR in Moscow in October 1958. These documents come from either the collection of the Union of Writers, which is preserved by the Russian State Archive of Literature and Arts (RGALI), or from the one of the Union of Soviet Friendship Societies with Foreign Countries which is held by the State Archive of the Russian Federation (GARF). As well as testifying to the broad network of Soviet-African relations, the documents shed light on Sembene’s biography and his early literary and cinematic work. Apart from the practical aspects related to the translation and publication of Sembene’s texts, the documents provide information about the impact of his work in the Soviet Union and the way it was received by his Soviet interlocutors. At the same time they show a number of expectations the Soviets had from Sembene, namely, to promote Soviet culture and literature in Africa. Some letters touch upon the role of cinema in Africa and reveal Sembene’s views and ambitions. Moreover, the young writer and aspirant filmmaker does not hide his political views. He criticizes the theorists and proponents of négritude and castigates the Society of African Culture, headed by Alioune Diop. Both the discussion and the correspondence illustrate Sembene’s views and present the picture of his personal ties and intellectual affinities with his comrades and benefactors on the Eastern side of the Iron Curtain.; À travers deux sources inédites – une discussion orale retranscrite et une correspondance de l’écrivain et cinéaste sénégalais Ousmane Sembène avec différentes personnalités soviétiques (traductrice, savants, écrivains) –, les auteur·e·s de l’article éclairent le réseau des relations africano-soviétiques qui se mettent en place au tournant des années 1950 et 1960, soit avant les indépendances. Les documents présentés ici ont été retrouvés dans les archives russes : dans le fonds de l’Union des écrivains de l’URSS qui se trouve aux Archives d’État de la littérature et des arts (RGALI) et dans celui de l’Union des sociétés d’amitié avec les pays étrangers, conservé aux Archives d’État de la Fédération de Russie (GARF). Au-delà des rapports strictement institutionnels qui se tissent durant la guerre froide, entre pays communistes et pays d’Afrique, la force de ces documents est de révéler les rapports interpersonnels qui se nouent entre l’écrivain sénégalais et différentes personnalités soviétiques, leurs affinités amicales et intellectuelles, d’éclairer également les désaccords théoriques entre Sembène et les tenants de la négritude et de la Société africaine de culture. De plus, ces documents permettent une approche originale de la biographie d’Ousmane Sembène : les lettres présentées donnent à voir la genèse de son œuvre littéraire, sa traduction en russe et la réception de ses écrits en Union soviétique, mais aussi les circonstances et modalités de sa venue au cinéma.
Published: 2021

9. On Fractional Fragility Rates of Graph Classes

Author: Dvořák, Zdeněk, Sereni, Jean-Sébastien, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Sereni, Jean-Sébastien, École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, and Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Abstract: International audience; We consider, for every positive integer a, probability distributions on subsets of vertices of a graph with the property that every vertex belongs to the random set sampled from this distribution with probability at most 1/a. Among other results, we prove that for every positive integer a and every planar graph G, there exists such a probability distribution with the additional property that for any set X in the support of the distribution, the graph G − X has component-size at most (∆(G) − 1) a+O(√ a) , or treedepth at most O(a 3 log 2 (a)). We also provide nearly-matching lower bounds.
Published: 2020
Full Text: View/download PDF

10. PCR La confluence Saône-Doubs à l'âge du Fer (Vie s. av. J.-C. au Ier siècle de notre ère): Annexes. Vol. 2

Author: Dubreucq, Émilie, Thivet, Matthieu, Bardel, David, Barral, Philippe, Berranger, Marion, Cicolani, Veronica, Cruz, Frédéric, Duchamp, Hélène, Dufour, Benjamin, Estur, Émilien, Filippini, Anne, Guillot, Morgane, Izri, Stéphane, JACCOTTEY, Luc, Labeaune, Régis, Lachiche, Caroline, Le Bailly, Matthieu, Monot, Nicolas, Nouvel, Pierre, Olmer, Fabienne., Péfau, Pierre, Pieters, Maxence, Rolland, Joëlle, Roure, Réjane, Sachetti, Federica, Sanchez, Christelle, Schaal, Caroline, Soichet, Julien, Taillandier, Valérie, Verriez, Quentin, Videau, Grégory, Travaux et recherches archéologiques sur les cultures, les espaces et les sociétés (TRACES), École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), UMR 5608 TRACES, UMR 6249 Chrono-environnement, Université de Franche-Comté (UFC), École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Chrono-environnement (UMR 6249) (LCE), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Institut national de recherches archéologiques préventives (Inrap), Université Bourgogne Franche-Comté [COMUE] (UBFC), Centre National de la Recherche Scientifique (CNRS), Université de Technologie Belfort-Montbéliard (UTBM), IRAMAT - Laboratoire Métallurgies et Cultures (IRAMAT - LMC), Institut de Recherches sur les Archéomatériaux (IRAMAT), Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), Archéologie et Philologie d'Orient et d'Occident (AOROC), École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Département des Sciences de l'Antiquité - ENS Paris (DSA ENS-PSL), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL), Ghent Archaeological Team, BIBRACTE EPCC, Mission Archéologique Départementale de l'Eure (MADE), Service Départemental de l'Archéologie, EVEHA (Etudes et valorisations archeologiques), Archéologie, Terre, Histoire, Sociétés [Dijon] (ARTeHiS), Ministère de la Culture et de la Communication (MCC)-Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS), Université de Bourgogne (UB), Centre Camille Jullian - Histoire et archéologie de la Méditerranée et de l'Afrique du Nord de la protohistoire à la fin de l'Antiquité (CCJ), Aix Marseille Université (AMU)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), Centre ardennais de recherche archéologique (CARA), Trajectoires - UMR 8215, Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), IRAMAT - Centre Ernest Babelon (IRAMAT-CEB), Institut de Recherche sur les Archéomatériaux (IRAMAT), Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université Paul-Valéry - Montpellier 3 (UPVM), Archéologie des Sociétés Méditerranéennes (ASM), Université Paul-Valéry - Montpellier 3 (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Ministère de la Culture (MC), Service Régional de l'Archéologie - DRAC PACA (SRA PACA), Ministère de la Culture et de la Communication (MCC), GeoArchEon SARL, Verriez, Quentin, Ministère de la Culture et de la Communication (MCC)-École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Chrono-environnement - CNRS - UBFC (UMR 6249) (LCE), Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Montaigne-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Montaigne-Université de Technologie de Belfort-Montbeliard (UTBM), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Univerzita Karlova v Praze, Centre National de la Recherche Scientifique (CNRS)-Ministère de la Culture (MC)-Université Paul-Valéry - Montpellier 3 (UPVM), and Service Régional d'Archéologie PACA
Subjects: Archélogie, [SHS.ARCHEO] Humanities and Social Sciences/Archaeology and Prehistory, Archéométrie, [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory, Télédétection, Bioarcheologie, Culture Matérielle, Géophysiques, Paléoenvironnements, Analyse documentaire
Abstract: https://www.nakala.fr/data/11280/8d5ff3f9; Ce rapport est un document administratif destiné à rendre compte des actions réalisées au cours de l’année 2019 dans le cadre du Projet Collectif de Recherche consacré à la confluence Saône-Doubs à l’âge du Fer, coordonné par Emilie Dubreucq et Matthieu Thivet
Published: 2020

11. A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth

Author: Jaroslav Nesetril, Patrice Ossona de Mendez, Computer Science Institute of Charles University [Prague] (IUUK), Charles University [Prague] (CU), Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), Supported by grant ERCCZ LL-1201 and CE-ITI P202/12/G061, and by the European Associated Laboratory 'Structures in Combinatorics' (LEA STRUCO), Department of Applied Mathematics (KAM) (KAM), and Univerzita Karlova v Praze
Subjects: Model theory, General Mathematics, Stone space, 0102 computer and information sciences, Tree-depth, 01 natural sciences, Graph, Combinatorics, Definable set, Measurable graph, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Mathematics - Combinatorics, Radon measures, Relational structure, 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Mathematics, Connected component, Discrete mathematics, Applied Mathematics, 010102 general mathematics, Graph limits, Colored, 010201 computation theory & mathematics, Bounded function, Standard probability space, Combinatorics (math.CO), First-order logic, Tuple, Structural limits
Abstract: In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various approaches to graph limits fit to this framework and that they naturally appear as "tractable cases" of a general theory. As an outcome of this, we provide extensions of known results. We believe that this put these into next context and perspective. For example, we prove that the sparse--dense dichotomy exactly corresponds to random free graphons. The second part of the paper is devoted to the study of sparse structures. First, we consider limits of structures with bounded diameter connected components and we prove that in this case the convergence can be "almost" studied component-wise. We also propose the structure of limits objects for convergent sequences of sparse structures. Eventually, we consider the specific case of limits of colored rooted trees with bounded height and of graphs with bounded tree-depth, motivated by their role of elementary brick these graphs play in decompositions of sparse graphs, and give an explicit construction of a limit object in this case. This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of {\em modeling} we introduce here. Our example is also the first "intermediate class" with explicitly defined limit structures., Comment: added journal reference
Published: 2020
Full Text: View/download PDF

12. Les opérations archéologiques menées à La Peyrouse (Saint-Félix-de-Villadeix, Dordogne) en 2019. Rapport final d’opération

Author: Eneko Hiriart, Christian Chevillot, Alexandre Bertaud, Marion Brochot, Pauline Corfmat, Anthony Coudart, Clément Coutelier, Magda Fabiani, Bernard Gratuze, Juliette Hantrais, Denis Loirat, Vivien Mathé, Fabienne Olmer, Julie Renou, Joëlle Rolland, Élisabeth Rousseau, Colette Sirieix, Romain Valette, Cecile Verdet, Université Bordeaux Montaigne (UBM), Centre National de la Recherche Scientifique (CNRS), LabEx Sciences archéologiques de Bordeaux (LASCARBX), Université de Bordeaux (UB)-Université Bordeaux Montaigne (UBM), IRAMAT-Centre de recherche en physique appliquée à l’archéologie (IRAMAT-CRP2A), Institut de Recherches sur les Archéomatériaux (IRAMAT), Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), Ausonius-Institut de recherche sur l'Antiquité et le Moyen âge, Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), Travaux et recherches archéologiques sur les cultures, les espaces et les sociétés (TRACES), École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), IRAMAT - Centre Ernest Babelon (IRAMAT-CEB), Laboratoire d'Anthropobiologie (LA), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS), LIttoral ENvironnement et Sociétés (LIENSs), La Rochelle Université (ULR)-Centre National de la Recherche Scientifique (CNRS), Centre Camille Jullian - Histoire et archéologie de la Méditerranée et de l'Afrique du Nord de la protohistoire à la fin de l'Antiquité (CCJ), Aix Marseille Université (AMU)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), Trajectoires - UMR 8215, Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche sur les Archéomatériaux (IRAMAT), Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université Sciences et Technologies - Bordeaux 1 (UB), Institut de Mécanique et d'Ingénierie (I2M), Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Arts et Métiers Sciences et Technologies, HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), Projet RAPSODIE (Reconnaissance des Agglomérations Protohistoriques du Sud-Ouest : Dynamiques, Imagerie, Environnement).Financement Région Nouvelle Aquitaine, Université Bordeaux Montaigne, Université Bordeaux Montaigne, Université de Bordeaux, Conseil Départemental 24, Ministère de la Culture et de la Communication, DRAC-SRA Nouvelle-Aquitaine, Région Nouvelle Aquitaine, Région Nouvelle-Aquitaine, ADRAHP, Cnrs, Université de La Rochelle, LIENSs (UMR 7266), Université Bordeaux Montaigne-Université de Bordeaux (UB), Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Ministère de la Culture et de la Communication (MCC)-École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J)-Centre National de la Recherche Scientifique (CNRS), École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS), LIttoral ENvironnement et Sociétés - UMRi 7266 (LIENSs), Université de La Rochelle (ULR)-Centre National de la Recherche Scientifique (CNRS), Univerzita Karlova v Praze, Université Sciences et Technologies - Bordeaux 1, Institut de Mécanique et d'Ingénierie de Bordeaux (I2M), École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Institut Polytechnique de Bordeaux-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-Institut National de la Recherche Agronomique (INRA), Université de Bordeaux (UB)-Université Bordeaux Montaigne, Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Montaigne-Université de Technologie de Belfort-Montbeliard (UTBM)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Montaigne-Université de Technologie de Belfort-Montbeliard (UTBM), École des hautes études en sciences sociales (EHESS)-Université Toulouse - Jean Jaurès (UT2J)-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Montaigne
Subjects: Agglomération antique, âge du Fer, LiDAR, [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory, Numismatique, Metallurgie, [PHYS.PHYS.PHYS-GEO-PH]Physics [physics]/Physics [physics]/Geophysics [physics.geo-ph], [SDU.STU.GM]Sciences of the Universe [physics]/Earth Sciences/Geomorphology, Prospections géophysique, Fouille archéologique, Agglomération gauloise, Prospections archéologiques
Abstract: 3 volumes
Published: 2020

13. Unity and Diversity in the Celtic World

Author: Pierrevelcin, Gilles, Kysela, Jan, Fichtl, Stephan, Archéologie et histoire ancienne : Méditerranée - Europe (ARCHIMEDE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Ministère de la Culture et de la Communication (MCC)-Centre National de la Recherche Scientifique (CNRS), and Univerzita Karlova v Praze
Subjects: [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory
Abstract: International audience; The volume presents the proceedings of the 42nd international colloquium of AFEAF, held in Prague (Czech Republic) from 10th to 13th May 2018. The aim of the colloquium was to furnish a new overview of the Iron Age cultures of west and central Europe. A key objective was to examine the relevance of the cultural groups which are currently either formally recognized or less firmly established, and more generally to investigate the interpretation of these archaeological entities at different chronological and spatial scales. This volume includes thirty-five contributions derived from twenty-five presentations given, and ten posters exhibited, during the conference. The articles in the first section examine historiographical and methodological issues and provide solid underpinnings on which to develop considerations of Iron Age cultural phenomena. The following, thematic contributions furnish European-scale syntheses on types of material culture or of structure, as well as on forms of social organization and on ritual practices. The third part of the volume considers regional approaches; here the identification of cultural markers, the drawing of distinctions between neighbouring groups, and the perennial question of hybrid cultures and zones displaying admixtures of cultural traits are explored. Overall, these proceedings demonstrate the diversity of approaches which are now being deployed, an indication of the important reconfiguration under way in both the problematiques and methods of approach related to the conference theme.; Ce volume rassemble les actes du 42e colloque international de l’AFEAF, tenu à Prague (République tchèque) du 10 au 13 mai 2018. Le colloque avait pour ambition de proposer un nouvel état des recherches sur les cultures de l’âge du Fer en Europe centrale et occidentale. Il s’agissait notamment d’interroger le degré de pertinence des groupes culturels aujourd’hui reconnus ou pressentis, mais aussi, plus largement, de poser la question de l’interprétation de ces ensembles archéologiques, à différentes échelles de temps et d’espace. Le présent volume regroupe trente-cinq contributions, reflet de vingt-cinq communications et dix posters présentés lors du colloque. Les articles traitant de questions historiographiques et méthodologiques fournissent en liminaire une base solide pour asseoir nos réflexions sur les phénomènes culturels de l’âge du Fer. Les contributions thématiques qui suivent livrent des synthèses sur des types de mobilier ou de structures, des formes d’organisation ou de rites, à l’échelle européenne. La troisième partie rassemble des approches régionales où l’identification des marqueurs, les différences avec les groupes voisins et la question récurrente des cultures hybrides et des zones mixtes sont explorées. Ces actes témoignent au total de la diversité des approches mises en œuvre, signe d’un renouvellement important des problématiques et méthodes d’étude en lien avec le thème de ce colloque.
Published: 2020

14. On fractional fragility rates of graph classes

Author: Zdenek Dvorak, Jean-Sébastien Sereni, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, and Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Combinatorics, Fragility, Computational Theory and Mathematics, Applied Mathematics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Discrete Mathematics and Combinatorics, Graph (abstract data type), Mathematics - Combinatorics, Geometry and Topology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Theoretical Computer Science, Mathematics
Abstract: We consider, for every positive integer $a$, probability distributions on subsets of vertices of a graph with the property that every vertex belongs to the random set sampled from this distribution with probability at most $1/a$. Among other results, we prove that for every positive integer $a$ and every planar graph $G$, there exists such a probability distribution with the additional property that for any set $X$ in the support of the distribution, the graph $G-X$ has component-size at most $(\Delta(G)-1)^{a+O(\sqrt{a})}$, or treedepth at most $O(a^3\log_2(a))$. We also provide nearly-matching lower bounds.
Published: 2019
Full Text: View/download PDF

15. Law and Mercy in The Merchant of Venice and the Present Refugee Crisis

Author: Bambušková, Tereza, Univerzita Karlova v Praze, New Faces Erasmus+ (convention n°2016-1-FR01-KA203-023980), Commission Européenne, New Faces Erasmus+, and Vienne-Guerrin, Nathalie
Subjects: [SHS.LITT] Humanities and Social Sciences/Literature, The Merchant of Venice, crisis, Shakespeare, [SHS.LITT]Humanities and Social Sciences/Literature, mercy, refugee, law
Published: 2019

16. 'I have no humour to marry' 1 : Representation of Conjugal Life in The Roaring Girl and its Reflections on Our Present Society

Author: Šedivá, Barbora, Univerzita Karlova v Praze, New Faces Erasmus+ (convention n°2016-1-FR01-KA203-023980), Commission Européenne, New Faces Erasmus+, and Vienne-Guerrin, Nathalie
Subjects: [SHS.LITT] Humanities and Social Sciences/Literature, Thomas Middleton, [SHS.LITT]Humanities and Social Sciences/Literature, conjugal life, The Roaring Girl, Crisis, Thomas Dekker
Published: 2019

17. From a Corrupt Eden to Bio-power: War and Nature in the Henriad

Author: Prochazka, Martin, Vienne-Guerrin, Nathalie, Univerzita Karlova v Praze, New Faces Erasmus+ (Convention N° 2016-1-FR01-KA203-023980), Commission Européenne, and New Faces Erasmus+
Subjects: Henry IV, [SHS.LITT] Humanities and Social Sciences/Literature, [SHS.LITT]Humanities and Social Sciences/Literature, Shakespeare, nature, Henry V, war, Henriad, Crisis
Published: 2019

18. From Privilege to Necessity: The Dual Nature of Mobility in The Winter’s Tale and Today

Author: Šedivá, Barbora, Vienne-Guerrin, Nathalie, Univerzita Karlova v Praze, New Faces Erasmus+ (Convention N° 2016-1-FR01-KA203-023980), Commission Européenne, and New Faces Erasmus+
Subjects: Mobility, [SHS.LITT] Humanities and Social Sciences/Literature, crisis, [SHS.LITT]Humanities and Social Sciences/Literature, Shakespeare, The Winter's Tale
Published: 2019

19. Approximations of Mappings

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Combinatorics, Model theory, Discrete mathematics, Conjecture, Unary operation, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Function (mathematics), Limit (mathematics), Inverse problem, Unary function, ComputingMilieux_MISCELLANEOUS, Decidability, Mathematics
Abstract: We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem of the construction of a continuous limit for first-order convergent sequences of finite mappings. We solve the approximation problem and, consequently, the full characterization of limit objects for mappings for first-order (i.e. $\mathrm{FO}$) convergence and local (i.e. $\mathrm{FO}^\mathrm{local}$) convergence. This work can be seen both as a first step in the resolution of inverse problems (like Aldous–Lyons conjecture) and a strengthening of the classical decidability result for finite satisfiability in Rabin class (which consists of first-order logic with equality, one unary function, and an arbitrary number of monadic predicates). The proof involves model theory and analytic techniques.
Published: 2019
Full Text: View/download PDF

20. 1968, cinquante ans plus tard

Author: Pithart, Petr and Univerzita Karlova v Praze
Subjects: Tchécoslovaquie, vie politique, [SHS.HIST]Humanities and Social Sciences/History, [SHS.SCIPO]Humanities and Social Sciences/Political science, Printemps de Prague
Abstract: Les vingt années de la normalisation ont jeté et jettent encore leur ombre portée sur 1968, sur le Printemps de Prague mais aussi sur les quelque trente années écoulées depuis la révolution de novembre 1989. Pourtant, les communistes réformateurs, ou plus précisément leurs chefs de file, ceux qui incarnèrent le Printemps de Prague, sont responsables de de cette situation. Du fait du choix honteux qu’ils ont fait face à l’adversité, celui du reniement...
Published: 2018

21. On generalized choice and coloring numbers

Author: Jean-Sébastien Sereni, Zdenek Dvorak, Jakub Pekárek, Computer Science Institute of Charles University [Prague] (IUUK), Charles University [Prague] (CU), Informatický Ústav Univerzity Karlovy (IUUK), Univerzita Karlova v Praze, Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, and Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Mathematics::Combinatorics, Applied Mathematics, 0211 other engineering and technologies, 021107 urban & regional planning, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, 01 natural sciences, Theoretical Computer Science, Combinatorics, 05C15, Computational Theory and Mathematics, 010201 computation theory & mathematics, Computer Science::Discrete Mathematics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), Geometry and Topology, Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph parameter., 17 pages, 2 figures
Published: 2018

22. Embeddability in R^3 is NP-hard

Author: Eric Sedgwick, Arnaud de Mesmay, Martin Tancer, Yo'av Rieck, GIPSA - Architecture, Géométrie, Perception, Images, Gestes (GIPSA-AGPIG), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Centre National de la Recherche Scientifique (CNRS), University of Arkansas [Fayetteville], School of Computing [DePaul] (SOC), DePaul University [Chicago], Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, de Mesmay, Arnaud, Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Department of Applied Mathematics [Prague] (KAM), and Charles University [Prague] (CU)
Subjects: Reduction (recursion theory), Boundary (topology), 0102 computer and information sciences, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Combinatorics, Computational topology, Simplicial complex, Dehn surgery, Artificial Intelligence, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], 0101 mathematics, Unknot, Mathematics::Symplectic Geometry, Time complexity, ComputingMilieux_MISCELLANEOUS, [MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT], Mathematics, 010102 general mathematics, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], 010201 computation theory & mathematics, Hardware and Architecture, Control and Systems Engineering, Computational problem, Software, Information Systems
Abstract: We prove that the problem of deciding whether a two- or three-dimensional simplicial complex embeds into R 3 is NP -hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an S 3 filling is NP -hard. The former stands in contrast with the lower-dimensional cases, which can be solved in linear time, and the latter with a variety of computational problems in 3-manifold topology, for example, unknot or 3-sphere recognition, which are in NP ∩ co- NP. (Membership of the latter problem in co-NP assumes the Generalized Riemann Hypotheses.) Our reduction encodes a satisfiability instance into the embeddability problem of a 3-manifold with boundary tori, and relies extensively on techniques from low-dimensional topology, most importantly Dehn fillings of manifolds with boundary tori.
Published: 2018
Full Text: View/download PDF

23. First-Order Interpretations of Bounded Expansion Classes

Author: Ossona De Mendez, Patrice, Gajarsky, Jakub, Kreutzer, Stephan, Nešetřil, Jaroslav, Mendez, Patrice Ossona De, Pilipczuk, Michał, Siebertz, Sebastian, Toruńczyk, Szymon, Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), Masaryk University [Brno] (MUNI), Technische Universität Berlin (TU), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW), Universität Bremen, and Wagner, Michael
Subjects: FOS: Computer and information sciences, Model checking, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), General Computer Science, Logic, Computer science, 0102 computer and information sciences, Characterization (mathematics), 01 natural sciences, Theoretical Computer Science, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Bounded expansion, Mathematics - Combinatorics, 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Discrete mathematics, 000 Computer science, knowledge, general works, 010102 general mathematics, Mathematics - Logic, First order, Graph, Logic in Computer Science (cs.LO), First-order logic, Computational Mathematics, 010201 computation theory & mathematics, Computer Science, Combinatorics (math.CO), Logic (math.LO), Computer Science - Discrete Mathematics
Abstract: The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over such graph classes. With the aim of generalizing such results to dense graphs, we introduce classes of graphs with structurally bounded expansion , defined as first-order transductions of classes of bounded expansion. As a first step towards their algorithmic treatment, we provide their characterization analogous to the characterization of classes of bounded expansion via low treedepth covers (or colorings), replacing treedepth by its dense analogue called shrubdepth.
Published: 2018
Full Text: View/download PDF

24. Les fonctions sociales de l’architecture dans les oppida tchèques

Author: Danielisová, Alžběta, Kysela, Jan, Křivánek, Roman, Archeologický ústav Akademie věd České republiky, Univerzita Karlova v Praze, Anne Villard-Le Tiec, Yves Menez, Patrick Maguer, and Coquet, Nicolas
Subjects: [SHS.ARCHEO] Humanities and Social Sciences/Archaeology and Prehistory, [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2018

25. Construction and characterization of a BAC library for functional genomics in Xenopus tropicalis

Author: Patrick Wincker, Jean Weissenbach, S. Dhorne-Pollet, Thierry Jaffredo, Vladimir Krylov, Nicolas Pollet, J.S. Fellah, C. A. da Silva, Julie Poulain, Karine Labadie, Tereza Tlapakova, Petra Spirhanzlova, Institute of Systems and Synthetic Biology, Université d'Evry Val d'Essonne, Department of Cell Biology - Faculty of Science, Charles University, Génétique Animale et Biologie Intégrative (GABI), Institut National de la Recherche Agronomique (INRA)-AgroParisTech, Université Paris-Saclay, Laboratoire de Biologie du Développement (LBD), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut de Biologie Paris Seine (IBPS), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Institut National de la Santé et de la Recherche Médicale (INSERM), Université Sorbonne Paris Cité (USPC), Genoscope - Centre national de séquençage [Evry] (GENOSCOPE), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Evolution, Génomes, Comportement et Ecologie, Université Paris Sud (Paris 11), Institut de Recherche pour le Développement (IRD [France-Ouest]), Genopole (Centre d'Exploration et de Recherche Fonctionnelle Amphibiens Poissons), Association Francaise contre les Myopathies (Amphigenetools), Centre National de la Recherche Scientifique, Universite d'Evry-Val d'Essonne, Universite Paris-Sud, Institut de biologie systémique et synthétique (ISSB), Université d'Évry-Val-d'Essonne (UEVE)-Centre National de la Recherche Scientifique (CNRS), Univerzita Karlova v Praze, Laboratoire de Biologie du Développement [IBPS] (LBD), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut de Biologie Paris Seine (IBPS), Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Évolution, génomes, comportement et écologie (EGCE), Université Paris-Sud - Paris 11 (UP11)-IRD-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Biologie du Développement [Paris] (LBD), Génomique et Physiologie de la Lactation (GPL), Institut National de la Recherche Agronomique (INRA), Biologie et écologie tropicale et méditerranéenne (BETM), Université de Perpignan Via Domitia (UPVD)-École pratique des hautes études (EPHE)-Centre National de la Recherche Scientifique (CNRS), Institut de Génomique d'Evry (IG), Institut de Biologie François JACOB (JACOB), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Institute of Systems and Synthetic Biology, Genopole, Universite d’Evry Val d’Essonne, Genavenir 3, AgroParisTech-Institut National de la Recherche Agronomique (INRA), Physiologie moléculaire et adaptation (PhyMA), Muséum national d'Histoire naturelle (MNHN)-Centre National de la Recherche Scientifique (CNRS), AgroParisTech-Université Paris-Saclay-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Structure et évolution des génomes (SEG), CNS-Université d'Évry-Val-d'Essonne (UEVE)-Centre National de la Recherche Scientifique (CNRS), Evolution, génomes, comportement et écologie (EGCE), and Institut de Recherche pour le Développement (IRD)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)
Subjects: 0301 basic medicine, Chromosomes, Artificial, Bacterial, Xenopus, [SDV]Life Sciences [q-bio], Sequence assembly, [SDV.BC.BC]Life Sciences [q-bio]/Cellular Biology/Subcellular Processes [q-bio.SC], Xenopus Proteins, Biology, [SDV.BID.SPT]Life Sciences [q-bio]/Biodiversity/Systematics, Phylogenetics and taxonomy, Genome, Insert (molecular biology), 03 medical and health sciences, 0302 clinical medicine, [SDV.BBM.GTP]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Genomics [q-bio.GN], [SDV.BA.ZV]Life Sciences [q-bio]/Animal biology/Vertebrate Zoology, [SDV.BC.IC]Life Sciences [q-bio]/Cellular Biology/Cell Behavior [q-bio.CB], genomics, Animals, Xenopus tropicalis, Molecular Biology, In Situ Hybridization, Fluorescence, ComputingMilieux_MISCELLANEOUS, BAC library, Gene Library, Comparative genomics, Genetics, [SDV.GEN.GPO]Life Sciences [q-bio]/Genetics/Populations and Evolution [q-bio.PE], [SDV.BID.EVO]Life Sciences [q-bio]/Biodiversity/Populations and Evolution [q-bio.PE], Chromosome Mapping, food and beverages, [SDV.BBM.BM]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Molecular biology, [SDV.BDD.MOR]Life Sciences [q-bio]/Development Biology/Morphogenesis, Sequence Analysis, DNA, Cell Biology, biology.organism_classification, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], genomic DNA, [SDV.GEN.GA]Life Sciences [q-bio]/Genetics/Animal genetics, 030104 developmental biology, [SDV.BDD.EO]Life Sciences [q-bio]/Development Biology/Embryology and Organogenesis, Liver, Female, amphibian, Functional genomics, 030217 neurology & neurosurgery, Developmental Biology, Reference genome
Abstract: International audience; Large insert genomic DNA libraries are useful resources for genomic studies. Although the genome of Xenopus tropicalis stands as the amphibian reference genome because it benefitted from large-scale sequencing studies, physical mapping resources such as BAC libraries are lagging behind. Here we present the construction and characterization of a BAC library that covers the whole X. tropicalis genome. We prepared this BAC library from the genomic DNA of X. tropicalis females of the Adiopodoume strain. We characterized BAC clones by screening for specific loci, by chromosomal localization using FISH and by systematic BAC end sequencing. The median insert size is about 110 kbp and the library coverage is around six genome equivalents. We obtained a total of 163,787 BAC end sequences with mate pairs for 77,711 BAC clones. We mapped all BAC end sequences to the reference X. tropicalis genome assembly to enable the identification of BAC clones covering specific loci. Overall, this BAC library resource complements the knowledge of the X. tropicalis genome and should further promote its use as a reference genome for developmental biology studies and amphibian comparative genomics.
Published: 2017
Full Text: View/download PDF

26. Contact Representations of Planar Graphs - Extending a Partial Representation is Hard

Author: Chaplick, Steven, Dorbec, Paul, Kratochvíl, Jan, Montassier, Mickaël, Stacho, Juraj, Kratsch, D., Todinca, I., Technische Universität Berlin (TU), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), and Columbia University [New York]
Subjects: Discrete mathematics, Partial representation, Horizontal and vertical, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Graph, law.invention, Planar graph, Combinatorics, symbols.namesake, law, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Bipartite graph, symbols, Circle graph, Time complexity, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
Abstract: Planar graphs are known to have geometric representations of various types, e.g. as contacts of disks, triangles or - in the bipartite case - vertical and horizontal segments. It is known that such representations can be drawn in linear time, we here wonder whether it is as easy to decide whether a partial representation can be completed to a representation of the whole graph. We show that in each of the cases above, this problem becomes NP-hard. These are the first classes of geometric graphs where extending partial representations is provably harder than recognition, as opposed to e.g. interval graphs, circle graphs, permutation graphs or even standard representations of plane graphs.On the positive side we give two polynomial time algorithms for the grid contact case. The first one is for the case when all vertical segments are pre-represented (note: the problem remains NP-complete when a subset of the vertical segments is specified, even if none of the horizontals are). Secondly, we show that the case when the vertical segments have only their x-coordinates specified (i.e., they are ordered horizontally) is polynomially equivalent to level planarity, which is known to be solvable in polynomial time.
Published: 2014
Full Text: View/download PDF

27. A Framework for Robust A Posteriori Error Control in Unsteady Nonlinear Advection-Diffusion Problems

Author: Martin Vohralík, Vít Dolejší, Alexandre Ern, Department of Numerical Mathematics, Univerzita Karlova v Praze, Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), Environmental Modeling, Optimization and Programming Models (POMDAPI), Inria Paris-Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Approximation property, unified framework, flux reconstruction, discontinuous Galerkin method, robustness, 010103 numerical & computational mathematics, 01 natural sciences, Upper and lower bounds, Discontinuous Galerkin method, Robustness (computer science), 0101 mathematics, Dual norm, Mathematics, a posteriori estimate, dual norm, Numerical Analysis, Applied Mathematics, Mathematical analysis, Estimator, unsteady nonlinear advection-diffusion problem, flux equilibration, 010101 applied mathematics, Computational Mathematics, Nonlinear system, A priori and a posteriori, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: International audience; We derive a framework for a posteriori error estimates in unsteady, nonlinear, possibly degenerate, advection-diffusion problems. Our estimators are based on a space-time equilibrated flux reconstruction and are locally computable. They are derived for the error measured in a space-time mesh-dependent dual norm stemming from the problem and meshes at hand augmented by a jump seminorm measuring possible nonconformities in space. Owing to this choice, a guaranteed and globally efficient upper bound is achieved, as well as robustness with respect to nonlinearities, advection dominance, domain size, final time, and absolute and relative size of space and time steps. Local-in-time and in-space efficiency is also shown for a localized upper bound of the error measure. In order to apply the framework to a given numerical method, two simple conditions, local space-time mass conservation and an approximation property of the reconstructed fluxes, need to be verified. We show how to do this for the interior-penalty discontinuous Galerkin method in space and the Crank--Nicolson scheme in time. Numerical experiments illustrate the theory.
Published: 2013
Full Text: View/download PDF

28. Les résidences des élites dans les oppida de Bohême ?

Author: Danielisová, Alžběta, Křivánek, Roman, Kysela, Jan, Archeologický ústav Akademie věd České republiky, Univerzita Karlova v Praze, AFEAF, SRA-DRAC Bretagne, Musée de Bretagne, CreAAH (UMR 6566), Inrap, Herma (EA 3811), Université de Poitiers, and Coquet, Nicolas
Subjects: [SHS.ARCHEO] Humanities and Social Sciences/Archaeology and Prehistory, [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2016

29. The fractional chromatic number of Zykov products of graphs

Author: Jean Sébastien Sereni, Pierre Charbit, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, and ANR-10-JCJC-0204,HEREDIA,Classes héréditaires de graphes(2010)
Subjects: Discrete mathematics, Mathematics::Combinatorics, Conjecture, Recurrence relation, Applied Mathematics, Computer Science::Neural and Evolutionary Computation, 010102 general mathematics, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Combinatorics, 05C15, Corollary, 010201 computation theory & mathematics, Product (mathematics), Chromatic scale, Fractional coloring, 0101 mathematics, Triangle-free graphs, Zykov graphs, Mathematics
Abstract: Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of a family of graphs. As a corollary, we deduce that the fractional chromatic numbers of the Zykov graphs satisfy the same recurrence relation as those of the Mycielski graphs, that is a n + 1 = a n + 1 a n . This solves a conjecture of Jacobs.
Published: 2011
Full Text: View/download PDF

30. Edge-face coloring of plane graphs with maximum degree nine

Author: Matěj Stehlík, Jean-Sébastien Sereni, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), and Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)
Subjects: Discrete mathematics, plane graph, 010102 general mathematics, 0102 computer and information sciences, Complete coloring, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, 1-planar graph, Brooks' theorem, Combinatorics, Greedy coloring, Edge coloring, 05C15, 010201 computation theory & mathematics, graph coloring, edge-face coloring, Discrete Mathematics and Combinatorics, Geometry and Topology, Graph coloring, 0101 mathematics, Fractional coloring, Mathematics, List coloring
Abstract: An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1–3):21–33, 1994] proved that every plane graph of maximum degree Δ⩾10 can be edge-face colored with Δ + 1 colors. We extend Borodin's result to the case where Δ = 9. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:332-346, 2011 © 2011 Wiley Periodicals, Inc.
Published: 2010
Full Text: View/download PDF

31. Graphs with bounded tree-width and large odd-girth are almost bipartite

Author: Daniel Král, Jean-Sébastien Sereni, Alexandr V. Kostochka, Michael Stiebitz, Department of Mathematics [Urbana], University of Illinois at Urbana-Champaign [Urbana], University of Illinois System-University of Illinois System, Institute of Mathematics [Novosibirsk], Institute of Mathematics of Novosibirsk, Institut teoretické informatiky (ITI), Charles University [Prague] (CU), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Institute of Mathematics - Technical University of Ilmenau, and Ilmenau University of Technology [Germany] (TU)
Subjects: Odd-girth, Circular coloring, Tree-width, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Theoretical Computer Science, Combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Chromatic scale, 05C83, 0101 mathematics, Mathematics, Discrete mathematics, 010102 general mathematics, 05C15, Graph, Treewidth, Computational Theory and Mathematics, 010201 computation theory & mathematics, Bounded function, Bipartite graph, Combinatorics (math.CO)
Abstract: International audience; We prove that for every k and every \epsilon > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + \epsilon.
Published: 2010
Full Text: View/download PDF

32. Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs

Author: Edita Máčajová, Jean-Sébastien Sereni, Attila Pór, Daniel Král, Institut teoretické informatiky (ITI), Charles University [Prague] (CU), Department of Computer Science - Comenius University, Comenius University in Bratislava, Department of Mathematics - Western Kentucky University (WKU), Western Kentucky University (WKU), Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics (KAM) (KAM), and Univerzita Karlova v Praze
Subjects: Discrete mathematics, Vertex (graph theory), General Mathematics, 010102 general mathematics, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Edge (geometry), 01 natural sciences, Steiner tree problem, Combinatorics, symbols.namesake, Steiner system, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0103 physical sciences, symbols, Cubic graph, 05B07, 05C15, 010307 mathematical physics, Affine transformation, 0101 mathematics, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
Abstract: It is known that a Steiner triple system is projective if and only if it does not contain the four-triple configuration C14. We find three configurations such that a Steiner triple system is affine if and only if it does not contain one of these configurations. Similarly, we characterise Hall triple systems using two forbidden configurations.Our characterisations have several interesting corollaries in the area of edge-colourings of graphs. A cubic graph G is S-edge-colourable for a Steiner triple system S if its edges can be coloured with points of S in such a way that the points assigned to three edges sharing a vertex form a triple in S. Among others, we show that all cubic graphs are S-edge-colourable for every non-projective nonaffine point-transitive Steiner triple system S.
Published: 2010
Full Text: View/download PDF

33. The Last Fraction of a Fractional Conjecture

Author: Jean-Sébastien Sereni, Daniel Král, František Kardoš, Institut teoretické informatiky (ITI), Charles University [Prague] (CU), Institute of Mathematics, P.J. Safarik University, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), and Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Conjecture, General Mathematics, 010102 general mathematics, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Graph, girth, Combinatorics, 05C15, total coloring, Computer Science::Discrete Mathematics, 010201 computation theory & mathematics, FOS: Mathematics, fractional coloring, Mathematics - Combinatorics, 05C15, 05C72, Combinatorics (math.CO), 0101 mathematics, Mathematics
Abstract: Reed conjectured that for every $\varepsilon>0$ and every integer $\Delta$, there exists $g$ such that the fractional total chromatic number of every graph with maximum degree $\Delta$ and girth at least $g$ is at most $\Delta+1+\varepsilon$. The conjecture was proven to be true when $\Delta=3$ or $\Delta$ is even. We settle the conjecture by proving it for the remaining cases., Comment: A typo has been corrected in the introduction (concerning the citation of the result by Ito, Kennedy and Reed)
Published: 2010
Full Text: View/download PDF

34. Counting Homomorphisms to Sparse Graphs

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Dense graph, Applied Mathematics, Nowhere dense set, Tree-depth, Graph, Combinatorics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Discrete Mathematics and Combinatorics, Homomorphism, Graph homomorphism, Boolean conjunctive query, Mathematics
Abstract: International audience; We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it has application to complexity of Boolean queries
Published: 2009
Full Text: View/download PDF

35. Untangling a Planar Graph

Author: Andreas Spillner, Chan-Su Shin, Xavier Goaoc, Yoshio Okamoto, Alexander Wolff, Jan Kratochvíl, Effective Geometric Algorithms for Surfaces and Visibility (VEGAS), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Discrete Optimization Laboratory, Toyohashi University of Technology, Departement of Electronics and Information Engineering, Hankuk University of Foreign Studies, Faculteit Wiskunde & Informatica, Technische Universiteit Eindhoven (TU/e), Algorithms, and Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.2, 0102 computer and information sciences, Computer Science::Computational Geometry, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Computer Science::Discrete Mathematics, Outerplanar graph, Discrete Mathematics and Combinatorics, I.3.5, 0101 mathematics, Mathematics, 010102 general mathematics, Binary logarithm, Graph, Planar graph, Computational Theory and Mathematics, 010201 computation theory & mathematics, symbols, Computer Science - Computational Geometry, Geometry and Topology, Computer Science - Discrete Mathematics
Abstract: A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of $G$. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to untangle $\delta$. We show that shift$(G,\delta)$ is NP-hard to compute and to approximate. Our hardness results extend to a version of \textsc{1BendPointSetEmbeddability}, a well-known graph-drawing problem. Further we define fix$(G,\delta)=n-shift(G,\delta)$ to be the maximum number of vertices of a planar $n$-vertex graph $G$ that can be fixed when untangling $\delta$. We give an algorithm that fixes at least $\sqrt{((\log n)-1)/\log \log n}$ vertices when untangling a drawing of an $n$-vertex graph $G$. If $G$ is outerplanar, the same algorithm fixes at least $\sqrt{n/2}$ vertices. On the other hand we construct, for arbitrarily large $n$, an $n$-vertex planar graph $G$ and a drawing $\delta_G$ of $G$ with fix$(G,\delta_G) \le \sqrt{n-2}+1$ and an $n$-vertex outerplanar graph $H$ and a drawing $\delta_H$ of $H$ with fix$(H,\delta_H) \le 2 \sqrt{n-1}+1$. Thus our algorithm is asymptotically worst-case optimal for outerplanar graphs., Comment: (v5) Minor, mostly linguistic changes
Published: 2009
Full Text: View/download PDF

36. A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs

Author: Michael Stiebitz, Jean-Sébastien Sereni, Daniel Král, Institut teoretické informatiky (ITI), Charles University [Prague] (CU), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Institute of Mathematics - Technical University of Ilmenau, and Ilmenau University of Technology [Germany] (TU)
Subjects: Discrete mathematics, perfect matching polytope, cubic graph, 05C70, General Mathematics, perfect matching, 010102 general mathematics, Strong perfect graph theorem, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Upper and lower bounds, Tutte theorem, Graph, brick and brace decomposition, Combinatorics, Computer Science::Discrete Mathematics, 010201 computation theory & mathematics, Trivially perfect graph, Cubic graph, 0101 mathematics, Mathematics
Abstract: International audience; We prove that every n-vertex cubic bridgeless graph has at least n/2 perfect matchings and give a list of all 17 such graphs that have less than n/2+2 perfect matchings.
Published: 2009
Full Text: View/download PDF

37. List colorings with measurable sets

Author: Jan Hladký, Daniel Kráal, Jean-Sébastien Sereni, Michael Stiebitz, Centre for Discrete Mathematics and its Applications [Warwick] (DIMAP), University of Warwick [Coventry], Institut teoretické informatiky (ITI), Charles University [Prague] (CU), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Institute of Mathematics - Technical University of Ilmenau, and Ilmenau University of Technology [Germany] (TU)
Subjects: list coloring, fractional chromatic number, 010102 general mathematics, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 16. Peace & justice, Hall's theorem, 01 natural sciences, 05C15, 010201 computation theory & mathematics, Discrete Mathematics and Combinatorics, measurable sets, Geometry and Topology, 0101 mathematics
Abstract: International audience; The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, then there exist sets such that each c(v) has measure one and for every pair of adjacent vertices v and v'. We provide a simpler proof of a measurable generalization of Hall's theorem due to Hilton and Johnson [J Graph Theory 54 (2007), 179-193] and show that the measurable list chromatic number of a finite graph G is equal to its fractional chromatic number.
Published: 2008
Full Text: View/download PDF

38. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Ossona de Mendez, Patrice, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Algebra homomorphism, Degree (graph theory), Context (language use), Hadwiger conjecture (graph theory), Theoretical Computer Science, Combinatorics, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Computational Theory and Mathematics, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Discrete Mathematics and Combinatorics, Graph homomorphism, Homomorphism, Geometry and Topology, Induced homomorphism (fundamental group), Mathematics
Abstract: National audience; We study restricted homomorphism dualities in the context of classes with bounded expansion (which are defined by means of the greatest reduced average densities—grads). This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is related to distance coloring of graphs and to the “approximate version” of the Hadwiger conjecture.
Published: 2008
Full Text: View/download PDF

39. Grad and classes with bounded expansion I. Decompositions

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, 05C15 05C75, Theoretical Computer Science, Combinatorics, Computational Theory and Mathematics, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Bounded expansion, Discrete Mathematics and Combinatorics, Partition (number theory), Mathematics - Combinatorics, Combinatorics (math.CO), Geometry and Topology, Invariant (mathematics), Mathematics
Abstract: International audience; We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width and low tree-depth colorings. This generalizes and simplifies several earlier results (obtained for minor closed classes).
Published: 2008
Full Text: View/download PDF

40. Grad and classes with bounded expansion II. Algorithmic aspects

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Dense graph, Subgraph isomorphism problem, 05C85 05C78, Graph theory, Tree-depth, Theoretical Computer Science, Combinatorics, Computational Theory and Mathematics, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Homomorphism, Combinatorics (math.CO), Geometry and Topology, Graph property, Time complexity, Mathematics
Abstract: Classes of graphs with bounded expansion have been introduced in [J. Nesetril, P. Ossona de Mendez, The grad of a graph and classes with bounded expansion, in: A. Raspaud, O. Delmas (Eds.), 7th International Colloquium on Graph Theory, in: Electronic Notes in Discrete Mathematics, vol. 22, Elsevier (2005), pp. 101-106; J. Nesetril, P. Ossona de Mendez, Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics (2005) (submitted for publication)]. They generalize classes with forbidden topological minors (i.e. classes of graphs having no subgraph isomorphic to the subdivision of some graph in a forbidden family), and hence both proper minor closed classes and classes with bounded degree. For any class with bounded expansion C and any integer p there exists a constant N(C,p) so that the vertex set of any graph [email protected]?C may be partitioned into at most N(C,p) parts, any [email protected]?p parts of them induce a subgraph of tree-width at most (i-1) [J. Nesetril, P. Ossona de Mendez, Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics (2005) (submitted for publication)] (actually, of tree-depth [J. Nesetril, P. Ossona de Mendez, Tree depth, subgraph coloring and homomorphism bounds, European Journal of Combinatorics 27 (6) (2006) 1022-1041] at most i, which is sensibly stronger). Such partitions are central to the resolution of homomorphism problems like restricted homomorphism dualities [J. Nesetril, P. Ossona de Mendez, Grad and classes with bounded expansion III. Restricted dualities, European Journal of Combinatorics (2005) (submitted for publication)]. We give here a simple algorithm for computing such partitions and prove that if we restrict the input graph to some fixed class C with bounded expansion, the running time of the algorithm is bounded by a linear function of the order of the graph (for fixed C and p). This result is applied to get a linear time algorithm for the subgraph isomorphism problem with fixed pattern and input graphs in a fixed class with bounded expansion. More generally, let @f be a first-order logic sentence. We prove that any fixed graph property of type may be decided in linear time for input graphs in a fixed class with bounded expansion. We also show that for fixed p, computing the distances between two vertices up to distance p may be performed in constant time per query after a linear time preprocessing. Also, extending several earlier results, we show that a class of graphs has sublinear separators if it has sub-exponential expansion. This result is best possible in general.
Published: 2008
Full Text: View/download PDF

41. Total-Coloring of Plane Graphs with Maximum Degree Nine

Author: Jean-Sébastien Sereni, Łukasz Kowalik, Riste Škrekovski, Institute of Informatics [Warsaw], Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW)-University of Warsaw (UW), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Faculty of Mathematics and Physics [Ljubljana] (FMF), and University of Ljubljana
Subjects: Discrete mathematics, total-coloring, Conjecture, Degree (graph theory), General Mathematics, 010102 general mathematics, Discharging method, planar graph, Total coloring, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 16. Peace & justice, 01 natural sciences, Graph, Planar graph, Combinatorics, symbols.namesake, 05C15, 010201 computation theory & mathematics, symbols, discharging method, 0101 mathematics, Mathematics
Abstract: The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree $\Delta$ admits a $(\Delta+2)$-total-coloring. Similar to edge-colorings—with Vizing's edge-coloring conjecture—this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if $\Delta\ge10$, then every plane graph of maximum degree $\Delta$ is $(\Delta+1)$-totally-colorable. On the other hand, such a statement does not hold if $\Delta\le3$. We prove that every plane graph of maximum degree 9 can be 10-totally-colored.
Published: 2008
Full Text: View/download PDF

42. Moving vertices to make drawings plane

Author: Goaoc, X., Kratochvil, J., Okamoto, Y., Shin, C.S., Wolff, A., Hong, S.K., Nishizeki, T., Quan, W., Effective Geometric Algorithms for Surfaces and Visibility (VEGAS), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Discrete Optimization Laboratory, Toyohashi University of Technology, Departement of Electronics and Information Engineering, Hankuk University of Foreign Studies, Faculteit Wiskunde & Informatica, Technische Universiteit Eindhoven (TU/e), and Algorithms
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Planar straight-line graph, Slope number, 0102 computer and information sciences, Computational Complexity (cs.CC), [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Combinatorics, symbols.namesake, Graph drawing, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Outerplanar graph, Wheel graph, Dominance drawing, 0101 mathematics, Mathematics, Discrete mathematics, Book embedding, 010102 general mathematics, Planar graph, Computer Science - Computational Complexity, 010201 computation theory & mathematics, symbols, Computer Science - Computational Geometry, Computer Science - Discrete Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to turn $\delta$ into a plane drawing of $G$. We show that shift$(G,\delta)$ is NP-hard to compute and to approximate, and we give explicit bounds on shift$(G,\delta)$ when $G$ is a tree or a general planar graph. Our hardness results extend to 1BendPointSetEmbeddability, a well-known graph-drawing problem., Comment: This paper has been merged with http://arxiv.org/abs/0709.0170
Published: 2008
Full Text: View/download PDF

43. Fraternal Augmentations of graphs, Coloration and Minors

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), and Elsevier
Subjects: Discrete mathematics, Applied Mathematics, Subgraph isomorphism problem, Tree-depth, 1-planar graph, Combinatorics, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Discrete Mathematics and Combinatorics, Graph homomorphism, Induced subgraph isomorphism problem, Homomorphism, Graph isomorphism, Mathematics
Abstract: We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r , ∇ r ( G ) . We generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings, a linear time algorithm to check subgraph isomorphism for a fixed pattern and homomorphism dualities.
Published: 2007
Full Text: View/download PDF

44. Algebraic and discretization error estimation by equilibrated fluxes for discontinuous Galerkin methods on nonmatching grids

Author: Ivana Šebestová, Martin Vohralík, Vít Dolejší, Department of Numerical Mathematics, Univerzita Karlova v Praze, Simulation for the Environment: Reliable and Efficient Numerical Algorithms (SERENA), Inria de Paris, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Mathematical optimization, Discretization, error components, stopping criteria, discontinuous Galerkin method, flux reconstruction, Theoretical Computer Science, adaptivity, Discontinuous Galerkin method, Simple (abstract algebra), Applied mathematics, Degree of a polynomial, Algebraic number, Mathematics, a posteriori estimate, Numerical Analysis, Adaptive mesh refinement, simple evaluation, Applied Mathematics, Linear system, General Engineering, linear diffusion problems, distribution of the error, Computational Mathematics, Computational Theory and Mathematics, hanging nodes, Poisson's equation, Software, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: International audience; We derive a posteriori error estimates for the discontinuous Galerkin method applied to the Poisson equation. We allow for a variable polynomial degree and simplicial meshes with hanging nodes and propose an approach allowing for simple (nonconforming) flux reconstructions in such a setting. We take into account the algebraic error stemming from the inexact solution of the associated linear systems and propose local stopping criteria for iterative algebraic solvers. An algebraic error flux reconstruction is introduced in this respect. Guaranteed reliability and local efficiency are proven. We next propose an adaptive strategy combining both adaptive mesh refinement and adaptive stopping criteria. At last, we detail a form of the estimates avoiding any practical reconstruction of a flux and only working with the approximate solution, which simplifies greatly their evaluation. Numerical experiments illustrate a tight control of the overall error, good prediction of the distribution of both the discretization and algebraic error components, and efficiency of the adaptive strategy.
Published: 2015
Full Text: View/download PDF

45. Counterweight Continent, Dehydrated Ocean and Carrack Mountain – Welcome to T. Pratchett’s Discworld

Author: Žaneta Dvořáková, Gałkowski, Artur, Gliwa, Renata, and Univerzita Karlova v Praze
Subjects: toponimy, funkcje onimiczne, onomastika literacka
Abstract: Terry Pratchett has created a fictional world, an integral part of which is a detailed and sophisticated system of place names. In his novels there are realistic names giving us an illusion of the real world and often serving as a characterization as well. Association is typical for a further kind of literary toponyms, the names refer to actual places on Earth, they activate our general cultural knowledge encyclopedia and play with the reader and his/her interpretive abilities. The last group of toponyms is purely artistic, they were created as a language game, probably the most important criterion was their aesthetic appeal. The names often deliberately destroy the illusion of reality and probability (we can talk about the anti-illusionist function), they demonstrate their artificiality, that they are a part of the author’s game. Whatever the motivation, meaning or possible allusion, all toponyms in the fictional world of the novels operate in the same way. They locate the story and help in spacial orientation within the Discworld, the names are an integral part of how the characters perceive and experience their space. Udostępnienie publikacji Wydawnictwa Uniwersytetu Łódzkiego finansowane w ramach projektu „Doskonałość naukowa kluczem do doskonałości kształcenia”. Projekt realizowany jest ze środków Europejskiego Funduszu Społecznego w ramach Programu Operacyjnego Wiedza Edukacja Rozwój; nr umowy: POWER.03.05.00-00-Z092/17-00.
Published: 2015

46. Cuts and bounds

Author: Jaroslav Nešetřil, Patrice Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), and École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, 05C15,06F99, Degree (graph theory), Homomorphism order, Cuts, Hadwiger conjecture (graph theory), Infimum and supremum, Theoretical Computer Science, Combinatorics, Bounds, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Homomorphism, Order (group theory), Discrete Mathematics and Combinatorics, Homomorphism extrema, Finite set, Maximal element, Mathematics
Abstract: We consider the colouring (or homomorphism) order C induced by all finite graphs and the existence of a homomorphism between them. This ordering may be seen as a lattice which is far from being complete. In this paper we study bounds and suprema and maximal elements in C of some frequently studied classes of graphs (such as bounded degree, degenerated and classes determined by a finite set of forbidden subgraphs). We relate these extrema to cuts of subclasses K of C (cuts are finite sets which are comparable to every element of the class K). We determine all cuts for classes of degenerated graphs. For classes of bounded degree graphs this seems to be a very difficult problem which is also mirrored by the fact that these classes fail to have a supremum. We note a striking difference between undirected and oriented graphs. This is based on the recent work of C. Tardif and J. Nešetřil. Also minor closed classes are considered and we survey recent results obtained by authors. A bit surprisingly this order setting captures Hadwiger conjecture and suggests some new problems.
Published: 2005
Full Text: View/download PDF

47. Colouring Edges with many Colours in Cycles

Author: Xuding Zhu, Jaroslav Nešetřil, P. Ossona de Mendez, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), Department of Mathematics [Hangzhou], Zhejiang University, and European Project: LEA STRUCO
Subjects: Discrete mathematics, Arboricity, Multigraph, Graph, Theoretical Computer Science, Combinatorics, Computational Theory and Mathematics, Bounded function, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Discrete Mathematics and Combinatorics, Partition (number theory), Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics
Abstract: International audience; The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arb_p(G) of a graph G as the minimum number of colours needed to colour the edges of a multigraph G in such a way that every cycle C gets at least min(|C|; p + 1) colours. In the particular case where G has girth at least p + 1, Arb_p(G) is the minimum size of a partition of the edge set of G such that the union of any p parts induce a forest. If we require further that the edge colouring be proper, i.e., adjacent edges receive distinct colours, then the minimum number of colours needed is the generalized p-acyclic edge chromatic number of G. In this paper, we relate the generalized p-acyclic edge chromatic numbers and the generalized p-arboricities of a graph G to the density of the multigraphs having a shallow subdivision as a subgraph of G.
Published: 2014
Full Text: View/download PDF

48. On the maximum average degree and the oriented chromatic number of a graph

Author: Alexandr V. Kostochka, Eric Sopena, Oleg V. Borodin, Jaroslav Nešetřil, André Raspaud, Raspaud, André, Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
Subjects: Discrete mathematics, Mathematics::Combinatorics, 010102 general mathematics, Oriented coloring, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Butterfly graph, Simplex graph, Theoretical Computer Science, Combinatorics, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Windmill graph, 010201 computation theory & mathematics, Graph power, Computer Science::Discrete Mathematics, Friendship graph, Petersen graph, Wheel graph, Physics::Accelerator Physics, Discrete Mathematics and Combinatorics, 0101 mathematics, Mathematics
Abstract: The oriented chromatic number o( H ) of an oriented graph H is defined as the minimum order of an oriented graph H ′ such that H has a homomorphism to H ′. The oriented chromatic number o( G ) of an undirected graph G is then defined as the maximum oriented chromatic number of its orientations. In this paper we study the links between o( G ) and mad( G ) defined as the maximum average degree of the subgraphs of G.
Published: 1999
Full Text: View/download PDF

49. Structural and anisotropy of magnetic susceptibility records of granitoid sheets emplacement during growth of a continental gneiss dome (Central Sudetes, European Variscan Belt)

Author: Lehmann, J., Schulmann, Karel, Edel, J.-B., Jezek, Josef, Hrouda, F., Lexa, O., Chopin, F., Dynamique de la lithosphère et des bassins sédimentaires (IPGS) (IPGS-Dylbas), Institut de physique du globe de Strasbourg (IPGS), Université de Strasbourg (UNISTRA)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Université de Strasbourg (UNISTRA)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Institute of Petrology and Structural Geology (IPSG), Charles University [Prague] (CU), Czech Geological Survey [Praha], Institute of Petrology and Structural geology, Ecole et Observatoire des Sciences de la Terre (EOST), and ANR-06-BLAN-0352,LFO in orogens,Laterally-forced overturns (LFO) enhanced by melt induced softening (MIS) in orogens: new model for continental tectonics(2006)
Subjects: [SDU.STU.TE]Sciences of the Universe [physics]/Earth Sciences/Tectonics, PLASTIC-DEFORMATION, NORTHEASTERN MARGIN, [SDE.MCG]Environmental Sciences/Global Changes, EASTERN VARISCIDES, FABRIC DEVELOPMENT, BOHEMIAN MASSIF, TONALITE SILL, MELT SEGREGATION, PRE-VARISCAN
Abstract: International audience; Granitoid magmatic sheets emplaced syntectonically during growth of the Orlica-nienik mantled gneiss dome (Central Sudetes, European Variscan belt) were examined by means of structural geology, quartz, and anisotropy of magnetic susceptibility (AMS) fabric studies. Magmatic emplacement was localized along the eastern transpressive margin of the high metamorphic core and below the low-grade detached mantle rimming the southern margin of the dome. In the first area, the magmatic sheets were emplaced parallel to the dilated subhorizontal foliation of an anisotropic pre-orogenic block. The resulting melt-host rock multilayer localized the transpressive zone along which the bulk of magma was emplaced. The AMS study shows an across-strike fabric zonation underlying a strongly transpressive solid-state deformation in the hanging-wall, magmatic subhorizontal fabric in the foot-wall and a transitional fabric in the center of the intrusion. In contrast, along the southern dome margin, magmatic sheets intruded along steep foliations of weakly metamorphic mantle rocks, and are affected by recumbent folding and subhorizontal shearing. The bulk of the sheets present a shallow-dipping magmatic foliation and an along-strike magmatic lineation. The variations of the quartz and magnetic fabrics are attributed to superimposition of pure shear-dominated ductile thinning followed by simple shear-dominated detachment onto the original steep fabric. AMS modeling confirms the role of variation of orientation of pre-intrusive anisotropy during progressive deformation on the resulting fabric pattern and helps explaining observed variations in fabric orientations and symmetries. This study highlights contrasting mechanical behavior of syntectonically emplaced magmas in different parts of a growing crustal-scale mantled gneiss dome. Keywords
Published: 2013

50. Modified Jeffery model: Influence of particle concentration on mineral fabric in moderately concentrated suspensions

Author: Jezek, Josef, Schulmann, Karel, Paterson, S., Department of Applied Mathematics (KAM) (KAM), Univerzita Karlova v Praze, Dynamique de la lithosphère et des bassins sédimentaires (IPGS) (IPGS-Dylbas), Institut de physique du globe de Strasbourg (IPGS), Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS), and UCLA
Subjects: [SDU.STU.TE]Sciences of the Universe [physics]/Earth Sciences/Tectonics, [SDE.MCG]Environmental Sciences/Global Changes, parasitic diseases, technology, industry, and agriculture, Physics::Optics
Abstract: International audience; A modified Jeffery model involving particle interactions allows the simulation of preferred orientation of crystals and the anisotropy of magnetic susceptibility in magmatic flow with up to 40% of rigid particle fraction. Numerical simulations are compared to analogue and natural fabrics. A study of the role of particle concentration shows that the increasing percentage of crystal fraction in dilute suspensions leads to progressive attenuation of the fabric intensity and cyclicity. At high strains in simple shear flow, the lineation converges to a constant value close to the shear plane. With increasing particle concentration, the fabric diverges from the shear direction reflecting the effect of increased crystal tiling. The model can be applied to quantify mineral preferred orientations of crystal mushes in magmatic fabric studies.
Published: 2013
Full Text: View/download PDF

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Region

Database

Publisher

369 results on '"Univerzita Karlova v Praze"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources