| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996384372603316 |
|
|
Autore |
Barton Samuel <1647 or 8-1715.> |
|
|
Titolo |
A sermon preached before the right honourable the Lord Mayor and aldermen of the city of London [[electronic resource] ] : in Guild-hall chappel upon Sunday the 20th of January, 1688/9 / / by Samuel Barton, Chaplain of St. Saviours |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, : Printed for Thomas Cockerill ..., 1689 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Soggetti |
|
Sermons, English - 17th century |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Reproduction of original in the British Library. |
|
|
|
|
|
|
Sommario/riassunto |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910892818603321 |
|
|
Titolo |
Archivio italiano di urologia e andrologia : Arch ital urol androl = Archives of Italian urology and andrology |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Pavia, : PAGEPress, 2010- |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Periodico |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9911016068003321 |
|
|
Autore |
Fernau Henning |
|
|
Titolo |
Combinatorial Algorithms : 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21–24, 2025, Proceedings / / edited by Henning Fernau, Binhai Zhu |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2025.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (0 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 15885 |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science - Mathematics |
Discrete mathematics |
Computer engineering |
Computer networks |
Algorithms |
Data structures (Computer science) |
Information theory |
Computer graphics |
Numerical analysis |
Discrete Mathematics in Computer Science |
Computer Engineering and Networks |
Design and Analysis of Algorithms |
Data Structures and Information Theory |
Computer Graphics |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Guarding a 1.5D terrain with Imprecise Viewpoints -- Extending simple monotone drawings -- Guarding Terrains with Guards on a Line -- Minimum-Complexity Graph Simplification under the Fréchet-Like Distance -- Drawing Reeb Graphs -- Monotone Partitions of Simple Polygons -- A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System -- Exact Learning of Weighted Graphs Using Composite Queries -- Monotone classes, even graphs and the Hamiltonian cycle problem -- Covering vertices by $4^+$-paths: A simpler local search coupled with a more delicate amortization -- Bicluster Editing with Overlaps: A Vertex Splitting Approach -- Vector spaces of graphs closed under isomorphism -- Average Sensitivity of Breadth-First Search Algorithms on Grids -- Permanent of bipartite graphs in terms of determinants -- Improved Approximation for Unpopularity in (3,3)-Hypergraph Matching with one-sided preferences -- Inverting Parameterized Burrows-Wheeler Transform -- A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences -- Fast Pattern Matching with Epsilon Transitions -- Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity (Extended Abstract) -- The Closed Geodetic Game: algorithms and strategies -- ETH Lower Bounds for $n$-Queens: Time Waits for Nobody -- On Solving Simple Curved Nonograms -- Tile-based Knot Assembly with Celtic! -- On the existence of a subgroup magic rectangle -- Parameterized Algorithms for Power Edge Set and Zero Forcing Set -- Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation -- Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function -- Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs -- Optimal Random Bit Sampling for Set Partition-like Structures -- Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile -- Linear Search with Probabilistic Detection and Variable Speeds -- Streaming Algorithms for Scheduling Jobs with Priorities. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 36th International Workshop on Combinatorial Algorithms, IWOCA 2025, held in Bozeman, MT, USA, during July 21-24, 2025. The 32 full papers and two abstracts of invited talks included in this book were carefully reviewed and selected from 71 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business. . |
|
|
|
|
|
|
|
| |