Year of publication
Type of material
Licence
Language
TIB reading rooms collection
1–20 of 48,657 hits
Sort by:
Sort by:
-
Advanced Flow-Based Multilevel Hypergraph Partitioning
Free accessDataCite | 2020|Keywords: Mathematics of computing → Network flows, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms -
Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization (Short Paper)
Free accessDataCite | 2023|Keywords: Mathematics of computing → Network optimization, Mathematics of computing → Continuous optimization, Mathematics of computing → Discrete optimization, Mathematics of computing → Ordinary differential equations, Mathematics of computing → Continuous functions, Mathematics of computing → Discretization, Mathematics of computing → Nonconvex optimization, Mathematics of computing → Graph algorithms -
LIPIcs, Volume 145, APPROX/RANDOM'19, Complete Volume
Free accessDataCite | 2019|Keywords: Mathematics of computing, Mathematics of computing; Theory of computation -
LIPIcs, Volume 151, ITCS'20, Complete Volume
Free accessDataCite | 2020|Keywords: Mathematics of computing, Mathematics of computing; Theory of computation -
Automatic Design of Boolean Networks for Cell Differentiation
Springer Verlag | 2017|Keywords: Mathematics of Computing -
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization
Free accessDataCite | 2022|Keywords: Mathematics of computing → Continuous optimization, Mathematics of computing → Discrete optimization, Mathematics of computing → Continuous functions, Mathematics of computing → Discretization, Mathematics of computing → Nonconvex optimization, Mathematics of computing → Graph algorithms -
On How Turing and Singleton Arc Consistency Broke the Enigma Code
Free accessDataCite | 2021|Keywords: Mathematics of computing → Combinatorial optimization, Mathematics of computing → Combinatoric problems -
Almost Optimal Testers for Concise Representations
Free accessDataCite | 2020|Keywords: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
Reaching a Consensus on Random Networks: The Power of Few
Free accessDataCite | 2020|Keywords: Mathematics of computing → Graph theory, Mathematics of computing → Probability and statistics, Mathematics of computing → Random graphs -
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
Free accessDataCite | 2023|Keywords: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Enumeration, Mathematics of computing → Permutations and combinations -
Algorithms for Length Spectra of Combinatorial Tori
Free accessDataCite | 2023|Keywords: Mathematics of computing → Enumeration, Mathematics of computing → Geometric topology, Mathematics of computing → Graphs and surfaces -
Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk)
Free accessDataCite | 2022|Keywords: Mathematics of computing → Enumeration, Mathematics of computing → Random graphs, Mathematics of computing → Generating functions -
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items
Free accessDataCite | 2019|Keywords: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture
Free accessDataCite | 2023|Keywords: Mathematics of computing → Matchings and factors, Mathematics of computing → Graph coloring, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph enumeration -
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
Free accessDataCite | 2020|Keywords: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
Free accessDataCite | 2019|Keywords: Mathematics of computing → Approximation algorithms, Mathematics of computing → Spectra of graphs, Mathematics of computing → Graph algorithms -
The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem
Free accessDataCite | 2020|Keywords: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Enumeration, Mathematics of computing → Combinatoric problems -
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
Free accessDataCite | 2020|Keywords: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms -
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Free accessDataCite | 2023|Keywords: Mathematics of computing → Graph theory, Mathematics of computing → Combinatorics -
Almost Optimal Distribution-Free Junta Testing
Free accessDataCite | 2019|Keywords: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms
Send my search to (beta)
Send your search query (search terms without filters) to other databases, portals and catalogues to find more interesting hits.
Dimensions:
full data search
or
title and abstract search
Dimensions is a database for abstracts and citations that links information on research funding with the resulting publications, studies and patents.
TIB AV portal
In the TIB AV-Portal, audiovisual media from science and teaching can be foundand own scientific videos can be published.
Specialised Information Service for Mobility and Transport Research (FID move)
Open Research Knowledge Graph (ORKG)
The FID move can be used to search for subject-specific literature, research data and other information from mobility and transport research.
The Open Research Knowledge Graph provides structured descriptions of research content and makes it comparable.
Common Union Catalogue (GVK)
Freely accessible part of the collaborative K10plus catalogue with materials relevant for interlibrary loan and direct delivery services.