-
Article
Open AccessGrazing distribution of wild guanacos and livestock in Patagonian rangelands: an ecological approach to assess mixed carrying capacity and overgrazing risk in extensive pastoral systems
Along with forage availability, rangeland’s carrying capacity (CC) is determined by other landscape features limiting the spatial distribution of the animals, such as water sources or topography. However, live...
-
Chapter and Conference Paper
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Temporal graphs are graphs that evolve over time. Many problems which are polynomial-time solvable in standard graphs become NP-hard when appropriately defined in the realm of temporal graphs. This suggested the ...
-
Article
Clinicopathological profile of peritoneal tuberculosis and a new scoring model for predicting mortality: an international ID-IRI study
Existing literature about peritoneal tuberculosis (TBP) is relatively insufficient. The majority of reports are from a single center and do not assess predictive factors for mortality. In this international st...
-
Article
Open AccessUrban Non-urban Agglomeration Divide: Is There a Gap in Productivity and Wages?
This paper investigates the productivity–wage relation using a novel and integrated employer-employee database covering the entire population of non-financial firms’ plants in one of the most developed regions...
-
Article
Classical fever of unknown origin in 21 countries with different economic development: an international ID-IRI study
Fever of unknown origin (FUO) is a serious challenge for physicians. The aim of the present study was to consider epidemiology and dynamics of FUO in countries with different economic development. The data of...
-
Article
Open AccessEulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph G at least (resp. exactly) once. This notion was first discussed by Leonhard Euler while solving the famous Seven Bri...
-
Chapter and Conference Paper
On Computing Optimal Temporal Branchings
The computation of out/in-branchings spanning the vertices of a digraph (also called directed spanning trees) is a central problem in theoretical computer science due to its application in reliable network des...
-
Chapter and Conference Paper
On Computing Large Temporal (Unilateral) Connected Components
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, \(\tau \)
-
Living Reference Work Entry In depth
Degrees of Separation and Diameter in Large Graphs
NA
-
Chapter
Interspecific Competition Between Guanacos and Livestock and Their Relative Impact on Patagonian Rangelands: Evidence, Knowledge Gaps, and Future Directions
The livestock crisis in Patagonia has intensified the historical conflict with the guanaco over natural pastures in recent years. Ranchers are concerned that the recovery of some guanaco populations, which is ...
-
Article
Profiles of multidrug-resistant organisms among patients with bacteremia in intensive care units: an international ID-IRI survey
Evaluating trends in antibiotic resistance is a requisite. The study aimed to analyze the profile of multidrug-resistant organisms (MDROs) among hospitalized patients with bacteremia in intensive care units (I...
-
Article
Open AccessK-plex cover pooling for graph neural networks
Graph pooling methods provide mechanisms for structure reduction that are intended to ease the diffusion of context between nodes further in the graph, and that typically leverage community discovery mechanism...
-
Chapter and Conference Paper
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph G at least (resp. exactly) once. This notion was first discussed by Leonhard Euler while solving the famous Seven Bri...
-
Article
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
Due to the sheer size of real-world networks, delay and space have become quite relevant measures of the cost of enumerating patterns for network analytics. This paper presents efficient algorithms for listing...
-
Chapter and Conference Paper
Edge-Disjoint Branchings in Temporal Graphs
A temporal digraph \(\mathcal{G}\) is a triple \((G, \gamma , \lambda )\) where G is a digraph, \(\gamma \) is a function on V(G) that tells us the time stamps when a vertex is active, and \(\lambda \) is a funct...
-
Article
Open AccessThe bow tie structure of the Bitcoin users graph
The availability of the entire Bitcoin transaction history, stored in its public blockchain, offers interesting opportunities for analysing the transaction graph to obtain insight on users behaviour. This pape...
-
Reference Work Entry In depth
Degrees of Separation and Diameter in Large Graphs
-
Chapter and Conference Paper
The Graph Structure of Bitcoin
In this paper we study the structure of the Bitcoin users graph derived from the transactions data stored in the Bitcoin blockchain. This work analyzes the macroscopic structure of the connectivity components ...
-
Chapter and Conference Paper
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs
An irredundant set of a hypergraph \(G = (V,\mathcal {H})\) is a subset S of its nodes such that removing any node fr...
-
Article
Open AccessRapid emergence of cryptococcal fungemia, Mycobacterium chelonae vertebral osteomyelitis and gastro intestinal stromal tumor in a young HIV late presenter: a case report
Highly active antiretroviral therapy has significantly changed the natural history of HIV infection, leading to a dramatic reduction of HIV-related morbidity and mortality. Late Presenters, Very Late Presenter...