322,856 research outputs found
Luigiaurelio Pomante. L’Università italiana nel Novecento. Nuovi itinerari storiografici e inediti percorsi di ricerca, Milano: FrancoAngeli, 2020, 205 pp.
No full textThis article review: Luigiaurelio Pomante. L’Università italiana nel Novecento. Nuovi itinerari storiografici e inediti percorsi di ricerca. Milano: FrancoAngeli, 2020, 205 pp
Il secolo dei trovatelli e il brefotrofio di Osimo. Un modello di istituto assistenziale tra fede e diplomazia nelle Marche dell'Ottocento.
No full textThis essay aims to reconstruct the history of a charitable institution for abandoned children created in the city of Osimo, in the region Marche, during the XIXth century. Particularly, it analyses the process and the preliminary debate for the opening of a ‘brefotrofio’ in the city, strongly desired by the cardinal bishop Giovanni Antonio Benvenuti, who was an example of welfare and diplomatic commitment. His episcopal work was intertwined with several politics events, such as the insurrections of 1830-1831, after which he was completely repudiated by the Roman Curia, also due to his bond with Carbonari movement’s, Freemasonry’s and Napoleonic exponents. In the specific instance, is reported the Leopoldo Armaroli’s contribution in the writing of the regulation for the ‘brefotrofio’, as an expert on the foundlings’ phenomenon
Memorie di scuola: le punizioni nelle aule marchigiane attraverso le testimonianze di ex-maestri e alunni tra gli anni Trenta e Sessanta del Novecento
No full textIl presente contributo intende indagare le reali pratiche disciplinari adottate all’interno delle aule scolastiche marchigiane tra gli anni Trenta e Sessanta, le quali sono state ricostruite attraverso le testimonianze orali di ex-maestri/e ed ex-alunni/e. La ricerca pone particolare attenzione alle punizioni corporali come le percosse, la verberazione con la bacchetta e la genuflessione sui ceci e dimostra come questi metodi disciplinari siano stati a lungo adottati, almeno fino alla fine degli anni Sessanta. Si evidenzia, inoltre, come tali pratiche siano diventate nel tempo una vera e propria consuetudine scolastica, sebbene fossero stati condannati dalla pedagogia ufficiale ed esistessero già precise norme proibenti tali pratiche.This paper aims to examine the disciplinary practices imposed by school teachers between the 1930’s and 1960’s in the Italian region of Marche. The research is focused on corporal punishments, such as beatings, caning or kneeling on dry chick peas, that were reconstructed through oral testimonies of both teachers and alumni. It should be pointed out that, with time, these disciplinary methods became embedded in school culture, and they were adopted at least until the end of the 1960’s, even though official pedagogy condemned such practices and there were specific regulations against them
Simultaneous visibility representations of plane st-graphs using L-shapes
No full textLet 〈 G r , G b 〉 be a pair of plane st-graphs with the same vertex set V. A simultaneous visibility representation with L-shapes of 〈 G r , G b 〉 is a pair of bar visibility representations 〈 Γ r , Γ b 〉 such that, for every vertex v ∈ V , Γ r ( v ) and Γ b ( v ) are a horizontal and a vertical segment, respectively, which share an end-point. In other words, every vertex is drawn as an L-shape, every edge of G r is a vertical visibility segment, and every edge of G b is a horizontal visibility segment. Also, no two L-shapes intersect each other. An L-shape has four possible rotations, and we assume that each vertex is given a rotation for its L-shape as part of the input. Our main results are: (i) a characterization of those pairs of plane st-graphs admitting such a representation, (ii) a quadratic time algorithm to recognize them, and (iii) a linear time drawing algorithm if the test is positive. As an application, starting from a simultaneous visibility representation with L-shapes, we show how to compute a simultaneous embedding of the two graphs with at most two bends per edge and right-angle crossings
L-Visibility Drawings of IC-Planar Graphs
No full textAn IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form of s suitably oriented "L", and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area with at most two bends per edge
On the upward book thickness problem: Combinatorial and complexity results
No full textAmong the vast literature concerning graph drawing and graph theory, linear layouts of graphs have been the subject of intense research over the years, both from a combinatorial and from an algorithmic perspective. In particular, upward book embeddings of directed acyclic graphs (DAGs) form a popular class of linear layouts with notable applications, and the upward book thick-ness of a DAG is the minimum number of pages required by any of its upward book embeddings.A long-standing conjecture by Heath, Pemmaraju, and Trenk (1999) states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an internally -triangulated outerpath or a cactus, and those whose biconnected components are st-outerplanar graphs.On the complexity side, it is known that deciding whether a graph has upward book thickness k is NP-hard for any fixed k >= 3. We show that the problem, for any k >= 5, remains NP-hard for graphs whose domination number is O(k), but it is fixed-parameter tractable (FPT) in the vertex cover number
Parameterized Algorithms for Queue Layouts
No full textAn h-queue layout of a graph G consists of a linear order of its vertices and a partition of its edges into h sets, called queues, such that no two independent edges of the same queue nest. The minimum h such that G admits an h-queue layout is the queue number of G. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts. As our first result, we show that deciding whether a graph G has queue number 1 and computing a corresponding layout is fixed-parameter tractable when parameterized by the treedepth of G. Our second result then uses a more restrictive parameter, the vertex cover number, to solve the problem for arbitrary h
Parameterized algorithms for book embedding problems
No full textA k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether G admits a k-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thick-ness, or not fixed, called Book Thickness. Both problems are known to be NP-complete in general. We show that Fixed-Order Book Thickness and Book Thickness are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed-Order Book Thickness is fixed-parameter tractable parameterized by the pathwidth of the vertex order
- …
