DOI,IST REx ID,Title of publication
10.1093/mnras/stw322,11578,The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23
10.1371/journal.pbio.2000234,1158,Shedding light on the grey zone of speciation along a continuum of genomic divergence
10.1007/978-3-319-50106-2_36,1164,Hanani-Tutte for radial planarity II
10.1007/978-3-319-50106-2_8,1165,C-planarity of embedded cyclic c-graphs
10.1371/journal.pcbi.1005218,1167,Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks
10.1038/srep38840,1172,Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae
10.1007/s00453-015-9997-6,1177,A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
10.1007/978-3-662-53641-4_8,1179,Pseudoentropy: Lower-bounds for chain rules and transformations
null,1182,Robust draws in balanced knockout tournaments
10.1016/j.cell.2016.11.013,1183,Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder
10.4230/LIPICS.ESA.2016.46,11834,Incremental exact min-cut in poly-logarithmic amortized update time
10.4230/LIPICS.ESA.2016.48,11835,Incremental and fully dynamic subgraph connectivity for emergency planning
10.4230/LIPICS.ICALP.2016.131,11836,Graph minors for preserving terminal distances approximately - lower and upper bounds
10.1002/ece3.2474,1184,Mating and longevity in ant males
10.1038/srep38094,1186,Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis
10.1145/2897518.2897638,11866,A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
10.1145/2897518.2897568,11867,New deterministic approximation algorithms for fully dynamic matching
10.1088/1742-5468/aa4e8f,1188,"Asymptotic analysis of noisy fitness maximization, applied to metabolism & growth"
null,1189,Dissipative Few-Body Quantum Systems
10.1137/140957299,11891,Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization